-
Notifications
You must be signed in to change notification settings - Fork 11
src metta_eval.pl
In MeTTaLog, different evaluation modes (eval_20, eval_40, and eval_70) provide varying degrees of control over how arguments are processed and how failures are handled during function evaluation. Below, we detail the distinctions between these modes and their appropriate use cases.
- When using
eval_20
, the function is responsible for explicitly evaluating its arguments usingeval_args
. This is essential when argument evaluation needs to be conditional, delayed, or selectively controlled. - This mode is commonly applied in "special forms," where premature evaluation would be incorrect or lead to unwanted behavior.
-
Conditional Expressions: In an expression like
(if $cond $then $else)
, evaluating all arguments upfront is incorrect because either$then
or$else
should be evaluated based on the outcome of$cond
. -
Short-Circuiting Logic: In expressions like
(or $code1 $code2)
, evaluating$code2
is unnecessary if$code1
already returns a truthy value.
- In
eval_20
, if evaluation fails, the function can prevent a value from being returned, giving the user full control over error management.
- Similar to
eval_20
, the function must manually evaluate arguments usingeval_args
and can determine how each argument is processed. - However, unlike
eval_20
, this mode requires that a value is returned even if an error occurs during evaluation.
- Scenarios where a fallback value is needed despite evaluation errors, ensuring that execution always results in a defined output.
- In
eval_70
, most arguments are pre-evaluated before being passed to the function. This simplifies function design by removing the need to manually evaluate each argument. - Important Note: Symbols and constants are not evaluated automatically and are passed as-is, making them available for symbolic manipulation or lazy evaluation within the function.
- Standard functions that do not require special control over argument evaluation, allowing for straightforward functional programming where arguments are predictably pre-evaluated.
- eval_20: Provides the most control, requiring manual evaluation and allowing full error handling, ideal for special forms.
-
eval_40: Similar control as
eval_20
, but ensures a return value even if evaluation fails. - eval_70: Most arguments are pre-evaluated, except when declared not to, making it suitable for regular functions that don’t need custom evaluation logic.
- The
eval
function always begins its evaluation with the current atomspace, typically referred to as&self
. - This atomspace (
&self
) serves as the default context for the evaluation process, containing all the symbols, functions, and rules available during evaluation. - When
eval
is called, it uses this context unless explicitly overridden, ensuring access to the definitions and state within the current module or environment.
- Functions like
eval_args
and other specializedeval_##
functions are not directly tied to&self
. Instead, they expect the evaluation context (like an atomspace) to be passed explicitly. - This design allows flexibility, enabling these functions to be used in various contexts, not just within the default
&self
space.
- The main
eval
function acts as a "controller" that sets up the environment and manages top-level evaluation. - The context-sensitive nature of
eval_args
and othereval_##
functions allows them to be adaptable and reusable across different scopes without being bound to the default atomspace.
- While
eval
defaults to&self
, it’s common to override this context when dealing with nested evaluations or alternative atomspaces. - This override is done by passing the new context to
eval_args
or other specialized evaluation routines.
-
eval: Always starts with
&self
as the context, ensuring that the current module or environment is the basis for evaluation. - eval_args and other eval_## functions: Expect the context to be passed to them, allowing for flexibility in nested or alternative evaluation contexts.
- The
eval
function not only starts from the&self
atomspace but also sets up control structures for handling errors, backtracking, and non-deterministic choices using a catch/throw mechanism. - At the start of
eval
, a "catch block" is established to capture exceptions or failures, allowing evaluation to either recover from errors or backtrack gracefully. - If an error or failure is encountered during evaluation, a "throw" operation can be invoked to exit the current evaluation and transfer control back to the catch block.
- Unification Failures: When a pattern doesn’t match, a throw allows evaluation to attempt alternative branches.
- Error Handling: When an unexpected error occurs, a throw can redirect control to a recovery routine or terminate the current path.
- Unlike
eval
, which sets up the catch/throw blocks,eval_args
and specializedeval_##
functions assume that the control structures are already in place. - These inner evaluation routines don’t establish their own catch/throw blocks and rely on the top-level
eval
to manage control flow, ensuring consistent handling of errors and branching logic.
- When
eval
sets up a catch block, it creates a checkpoint. If a failure or error occurs during evaluations, the throw redirects control back to this checkpoint. -
Example: If a function application fails due to an invalid argument,
eval_args
might throw an error, passing control back toeval
, which decides the next step (retry, skip, report, etc.).
- Since
eval
is aware of broader control flow, it decides whether to retry an operation, select a different path, or terminate the evaluation. This decision-making is guided by catch/throw blocks. -
eval_args
and other specialized functions participate within this context but do not engage in the decision-making.
- eval: Sets up catch/throw blocks, establishing a control context that manages errors, backtracking, and non-deterministic branching.
-
eval_args and Specialized eval_## Functions: Operate within the catch/throw context set by
eval
, evaluating expressions and passing control back in case of errors or failures. -
Catch/Throw Mechanism: Provides a robust framework for handling unification failures, errors, and alternative branching, centralizing control within
eval
while allowing flexible nested evaluations.
String functions implemented by @royward would ideally fit into eval_70
because they involve straightforward pre-evaluated argument handling. However, there’s an important technical limitation: explicit type information is required for a function to operate within eval_70
.
- eval_70 is ideal for functions like string operations that don’t require special argument handling. Instead, they work well with pre-evaluated arguments.
- Until recently, around 80% of the MeTTa library lacked proper type declarations for its internals. Without explicit type information, the system cannot reliably classify these functions into
eval_70
. - As more type annotations are added, it will become easier to move suitable functions into
eval_70
, improving performance and evaluation consistency.
- The situation has improved, and now about 20% of the library remains without type declarations. Continued progress on type annotations will allow more functions, like Roy’s string operations, to be classified into
eval_70
.
Operations like intersection
, unique
, and union
require fine-grained, lazy control over argument evaluation, making them unsuitable for eval_70
.
-
First Argument Iteration:
- The first argument (e.g., a list or iterator) is iterated element by element.
-
Selective Iteration of Subsequent Arguments:
- For each element from the first argument, the second argument is iterated to find a unifiable match.
- If a match is found early, it pauses, and control returns to the first argument’s iterator.
-
Handling Exhaustive Iteration:
- If the second argument’s iterator completes without a match, results are memoized, and control returns to the first argument.
- Pausing and Resuming Iterators: Each argument must pause and resume based on whether a match is found.
-
Non-Deterministic Evaluation:
eval_70
cannot express this control pattern since it demands conditional, step-by-step evaluation.
- Operations like
intersection
,union
, andunique
must remain ineval_20
, where:- Arguments are evaluated lazily.
- The order and timing of evaluation are fully controlled based on intermediate results, supporting non-deterministic logic.
This wiki page provides a detailed overview of key concepts in MeTTaLog's evaluation process, guiding developers through the rationale behind different evaluation modes and their applications.