MeTTa (Meta Type Talk) is a multi-paradigm language for declarative and functional computations over knowledge metagraphs.

MeTTa programs consist of atoms, which can be expressions (in parentheses), individual symbols, or grounded atoms. During parsing, these atoms are sequentially processed and added to a program Space. Binary objects such as operations (like +) and numerical values (like 1.05) are wrapped in grounded atoms.

To immediately evaluate an atom instead of adding it to the Space, prefix it with an exclamation mark (!). The evaluation result won't be stored in the Space but will appear in the program's output.

When evaluating expressions, those beginning with a grounded atom containing an operation will execute that operation on the remaining elements of the tuple as arguments.

Learn more about the MeTTa programming language for AGI and beyond: https://metta-lang.dev/