The examples directory houses a variety of sub-directories, each focusing on specific functionalities, tests, or demonstrations. These sub-directories serve as a comprehensive resource for understanding the system.
flybase: Focused on the Flybase module, the examples here are designed to provide insights into how this specific component works and can be used.flybase-deduced-queries.metta[output]: Contains queries deduced from Flybase data analysis.flybase-loader-size-estimates.metta[output]: Size estimates and optimizations for the Flybase loader.flybase-loader.metta[output]: Loader script for Flybase datasets.flybase-vspace.metta[output]: Virtual space configuration for Flybase.flybase-deduced-connections.metta[output]: Mapping and connections deduced in Flybase.flybase-deduced-types.metta[output]: Type definitions and structures deduced in Flybase.output~: Output files and processed data from Flybase.flybase-deduced.metta[output]: Deduced results and insights from Flybase data.flybase-mined-flat.metta[output]: Flat structure representation of mined data in Flybase.flybase-mined.metta[output]: Original mined data from Flybase.
sanity: Sanity checks and basic tests for Flybase module.download_file.metta[output]: Tests downloading a remote version of Flybase.load_all_of_flybase.metta[output]: Demonstrates loading all 54 million atoms in under 30 seconds.simple_query1.metta[output]: Queries using the loaded atoms that complete in under a second.simple_query2_llm.metta[output]: Combined queries with large language models.
flybase/from_das: Showcases the integration of Flybase with Distributed Atomspace (DAS), a system for managing and processing distributed atom-based data.flybase_rust_uses_python_das.metta[output]: Demonstrates how Flybase utilizes Python and Rust to interact with DAS, enhancing its data analysis and processing capabilities.
flybase/from_rust: Features Flybase loaded exclusively in Rustflybase_rust_only.metta[output]: Illustrates the pure Rust implementation of Flybase, highlighting its efficiency and direct integration with system-level functionalities.
flybase/from_vspace: Using Rust to access Flybase with VSPACE ( hosting 56 million atoms )flybase_rust_uses_python_vspace.metta[output]: Showcases Flybase leveraging Python VSPACE within a Rust environment, focusing on efficient handling and manipulation of a vast space containing millions of atoms.
extended_compat/hyperon-miner/: Hyperon miner directorydata/sample.metta[output]: Sample data for Hyperon miner testing.utils/MinerUtils.metta[output]: Utility functions for Hyperon mining operations.match/MinerMatchTest.metta[output]: Test cases for Hyperon miner matching algorithms.match/MinerMatch.metta[output]: Implementation of matching algorithms for Hyperon miner.
extended_compat/metta-examples/combinator_logic_experiments/: Combinator Logic Experiments Directoryy_comb_examples.metta[output]: Examples and experiments with Y combinators.
extended_compat/metta-examples/logic/: Metta Logic Directorypuzzle.metta[output]: Logic puzzles and solutions in Metta.all_any.metta[output]: Implementations of universal and existential quantifiers.memb.metta[output]: Member checking functions in logical expressions.
extended_compat/metta-examples/SICP_book/: SICP Book Examples in Metta
extended_compat/metta-examples/recursion-schemes/src/: Recursion Schemes in Mettaschemes.metta[output]: Various recursion schemes implemented in Metta.base.metta[output]: Base functions and utilities for recursion schemes.expression.metta[output]: Expression handling in recursion schemes.benchmark.metta[output]: Benchmark tests for recursion scheme implementations.
extended_compat/metta-examples/prob-dep-types/: Probabilistic Dependent Types in Mettaprob_dep_types.metta[output]: Definitions and examples of probabilistic dependent types.inf_order_probs.metta[output]: Infinite order probabilities and their applications.
nars/current: The current iteration of the Non-Axiomatic Reasoning System (NARS) showcasing the latest features and tests.NARS.metta[output]: Main script for the current version of NARS.tests0.metta[output]: Basic tests for the current NARS version.tests1.metta[output]: Comprehensive level tests for NARS functionalities.tests2.metta[output]: Advanced testing scenarios for NARS.tests3.metta[output]: Tests focusing on specific reasoning capabilities in NARS.tests4.metta[output]: Specialized tests for complex reasoning in NARS.tests5.metta[output]: Simple test for complex reasoning in NARS.
nars/new: Houses the latest developments and experimental features in NARS.NARS.metta[output]tests0.metta[output]tests1.metta[output]tests2.metta[output]tests3.metta[output]tests4.metta[output]tests5.metta[output]: Reflects ongoing experiments and cutting-edge features in NARS development.
nars/nars_extras: Additional scripts and utilities for NARS.NARS_BuildTupleCounts.metta[output]: Script for building tuple counts in NARS.RUN_minnars.metta[output]: Execution script for MinNARS, a minimalistic version of NARS.RUN_minnars_trimmed.metta[output]: Trimmed version of the MinNARS execution script.TestNARS_listing.metta[output]: Comprehensive test listings and scripts for NARS.
nars/prev: Includes tests and scripts from previous versions of NARS, showcasing the evolution of the system.NARS.metta[output]tests0.metta[output]tests1.metta[output]tests2.metta[output]tests3.metta[output]tests4.metta[output]tests5.metta[output]: Provides a historical perspective on the progression and updates in NARS.
nars/nars_v0: The original version of NARS, preserving the initial features and tests.NARS.metta[output]: Main script for the original NARS version.NARS-old.metta[output]: Older version of the NARS main script.tests0.metta[output]tests1.metta[output]tests2.metta[output]tests3.metta[output]tests4.metta[output]tests5.metta[output] A series of tests ranging from basic to comprehensive for the original NARS version.
-
python_compat/hyperon-experimental_python/sandbox/: Hyperon Experimental Python Sandboxresolve/r.metta[output]: Resolution algorithms in Hyperon Python sandbox.sql_space/sql_space_test.metta[output]: Test scripts for SQL space integration in Hyperon.neurospace/test_assist.metta[output]: Assistant scripts for neurospace simulations.neurospace/test_nspace.metta[output]: Neurospace testing and simulation scripts.numpy/nm_test.metta[output]: Numpy integration tests in Hyperon Python environment.das_gate/test_das.metta[output]: Test scripts for DAS gate functionality in Hyperon.
-
python_compat/extend/: Metta-Morph Python Compatibility Layer for NARS -example6.metta[output]: Example script 6 for Python compatibility layer. -compileme.metta[output]: Compilation scripts for Python compatibility extensions. -example2.metta[output]: Example script 2 for extended functionalities. -example5.metta[output]: Example script 5 showcasing extended features. -example4.metta[output]: Example script 4 demonstrating extended capabilities. -example1.metta[output]: Example script 1 for Python compatibility tests. -example3.metta[output]: Example script 3 in Python compatibility layer. -timing.metta[output]: Timing and performance testing scripts. -mettamorph.metta[output]: Inital Script of MeTTa-Morph.
This group of directories explores various representational methods for porting PLN to MeTTa.
-
extended_compat/hyperon-pln/metta/: Hyperon PLN Metta Base Compatibility -
entail: Here, rules are expressed with the symbol?.DeductionEntailTest.metta[output]: Tests for deduction entailment in MeTTa.ImplicationDirectIntroductionEntail.metta[output]: Direct implication introduction entailment logic.ImplicationDirectIntroductionEntailTest.metta[output]: Tests for direct implication introduction entailment.DeductionEntail.metta[output]: Logic for deduction entailment in MeTTa.
-
common: Contains common definitions for PLN in MeTTa.Num.metta[output]: Numerical utilities and definitions.Record.metta[output]: Record structures and related logic.DeductionFormula.metta[output]: Formulae for logical deduction.ImplicationDirectIntroductionFormula.metta[output]: Formulae for direct implication introduction.ModusPonensFormula.metta[output]: Formulae for modus ponens logic.DeductionFormulaTest.metta[output]: Test cases for logical deduction formulae.OrderedSet.metta[output]: Implementation of ordered sets.EqualityType.metta[output]: Equality types and related logic.ListTest.metta[output]: Tests for list operations.NumTest.metta[output]: Tests for numerical utilities.OrderedSetTest.metta[output]: Tests for ordered set implementation.Num8.metta[output]: Extended numerical operations.Maybe.metta[output]: Implementation of 'Maybe' monad.MaybeTest.metta[output]: Tests for 'Maybe' monad.EqualityTypeTest.metta[output]: Tests for equality type logic.In.metta[output]: Logic for element inclusion.List.metta[output]: List operations and utilities.TruthValue.metta[output]: Base structure for truth values.EvidentialTruthValue.metta[output]: Evidential truth value implementation.EvidentialTruthValueTest.metta[output]: Evidential truth value Tests.TruthValueTest.metta[output]: General tests for truth values.TemporalTruthValue.metta[output]: Temporal aspect of truth values.MeasEq.metta[output]: Measurement equality logic.InTest.metta[output]: Tests for element inclusion logic.BelieveMe.metta[output]: Logic for belief representation.
-
HOL: Showcases HOL (Higher-Order Logic) operations.ListTest.metta[output]: Test cases for list operations in HOL.NatTest.metta[output]: Test cases for natural number operations in HOL.NatSimpleTest.metta[output]: Simplified tests for natural numbers in HOL.
-
dependent-types: Concentrates on representing rules as type constructors.ModusPonensDTLTest.metta[output]: Test cases for modus ponens in dependent type logic.ImplicationDirectIntroductionDTL.metta[output]: Direct implication introduction in dependent type logic.DeductionImplicationDirectIntroductionDTLTest.metta[output]: Tests for deduction and direct implication introduction.ImplicationDirectIntroductionDTLTest.metta[output]: More tests for direct implication introduction.DeductionDTL.metta[output]: Deduction logic in dependent type language.DeductionDTLTest.metta[output]: Tests for deduction in dependent type language.ModusPonensDTL.metta[output]: Modus ponens implementation in dependent type language.
-
forward-chainer: Focuses on forward-chaining logic.forward-chainer-test.metta[output]: Test cases for forward-chaining logic.forward-chainer-xp.metta[output]: Experimental forward-chaining implementations.
-
subtyping: Showcases subtyping operations.rule-base.metta[output]: Base rules for subtyping operations.subtyping-test.metta[output]: Test cases for subtyping.
-
sumo: Houses SUMO (Suggested Upper Merged Ontology) examples.load-suo-kif.metta[output]: Logic for loading SUMO KIF files.rule-base.metta[output]: Base rules for SUMO logic.sumo/john-carry-flower: Narrative logic examples.john-carry-flower-test.metta[output]: Test cases for the John carrying a flower narrative.john-carry-flower.kif.metta[output]: KIF narrative for John carrying a flower.
sumo/orientation: Related to spatial orientation.orientation-test.metta[output]: Tests for orientation logic in SUMO.orientation.kif.metta[output]: Knowledge Interchange Format files for orientation.
sumo/located: Pertains to location-based logic.located-test.metta[output]: Tests for location-based logic in SUMO.located.kif.metta[output]: KIF files for location-based logic.
sumo/route-between: Deals with routing logic.
synthesis/experiments: Experiments in program synthesis.synthesize-via-unify-test.metta[output]: Tests for synthesis through unification.unify-via-case.metta[output]: Unification viacaseoperator construct.synthesize-via-case.metta[output]: Synthesis throughcaseoperator construct.synthesize-via-let.metta[output]: Synthesis using the 'let' construct.synthesize-via-unify.metta[output]: Synthesis through unification techniques.synthesize-via-let-test.metta[output]: Tests for synthesis using the 'let' construct.synthesize-via-case-test.metta[output]: Tests for synthesis throughcaseoperator construct.unify-via-let.metta[output]: Unification using the 'let' construct.non-determinism.metta[output]: Explorations of non-determinism in synthesis.synthesize-via-superpose.metta[output]: Synthesis through superposition.synthesize-via-type-checking.metta[output]: Synthesis with type checking.self-contained-synthesize.metta[output]: Self-contained examples of synthesis.synthesize-via-unify-test-longer.metta[output]: Extended tests for synthesis through unification.
match: Logic for matching and unification.DeductionImplicationDirectIntroductionMatchTest.metta[output]: Tests for matching in deduction and direct implication introduction.DeductionMatch.metta[output]: Logic for deduction matching.ImplicationDirectIntroductionMatchTest.metta[output]: Tests for direct implication introduction matching.DeductionMatchTest.metta[output]: Test cases for deduction matching.ImplicationDirectIntroductionMatch.metta[output]: Logic for direct implication introduction matching.
metta-morph_tests: Test cases exploring various features and functionalities in MeTTa.minnars.metta[output]: Tests and examples for MinNARS implementation.sequential_nested.metta[output]: Experiments with sequential and nested structures.peano.metta[output]: Implementations and tests for Peano arithmetic.if.metta[output]: Tests for 'if' conditional structures.types.metta[output]: Exploration of type systems and their behaviors.states_spaces.metta[output]: Experiments with state spaces.supercollapse.metta[output]: Tests for collapse operations.zeroargs.metta[output]: Investigating functions with zero arguments.match_feval.metta[output]: Function evaluation within match structures.nalifier.metta[output]: NAL (Non-Axiomatic Logic) implementation tests.factorial.metta[output]: Factorial function implementations and tests.types2.metta[output]: Further exploration into types and their applications.and_or.metta[output]: Logical operations and their behavior in different contexts.let_superpose_list.metta[output]: Experiments with 'let' in listsuperpose.multifunction.metta[output]: Tests for multifunctional behaviors.match_void.metta[output]: Exploring match operations with void returns.let_superpose_if_case.metta[output]: Superposing 'let' with 'if' and 'case' structures.types3.metta[output]: Advanced type system explorations.add_atom_match.metta[output]: Atom addition within match structures.let_superpose_list2.metta[output]: Advanced list superposition with 'let'.superpose_nested.metta[output]: Nested structuresuperpose.identity.metta[output]: Tests for identity functions and operations.nested_parameters.metta[output]: Experiments with nested parameter structures.match_superposed_spaces.metta[output]: Matching within superposed spaces.collapse.metta[output]: Tests for collapse operations in various contexts.letlet.metta[output]: Experiments with nested 'let' structures.
hyperon-mettalog_sanity: Sanity checks and basic tests for Hyperon Mettalog.02-curried-plus.metta[output]: Implementations and tests for curried addition functions.00_lang_case.metta[output]: Case studies in language design and implementation.01_lang_inc.metta[output]: Increment functions and their usage in language testing.04_match_list_like_space.metta[output]: Matching lists in space-like structures.structure-tests.metta[output]: Structural tests for sanity checking.05_match_superpose_element_like_space.metta[output]: Matching tests with superposition in element-like spaces.00_lang_ok_to_redefine.metta[output]: Tests for language redefinition capabilities.
hyperon-mettalog_sanity: Sanity checks and basic tests for Hyperon Mettalog.02-curried-plus.metta[output]: Implementations and tests for curried addition functions.00_lang_case.metta[output]: Case studies in language design and implementation.01_lang_inc.metta[output]: Increment functions and their usage in language testing.04_match_list_like_space.metta[output]: Matching lists in space-like structures.
hyperon-experimental_scripts: Scripts for experimenting with advanced concepts in Hyperon._e2_states_dia.metta[output]: State diagrams and their representation.a1_symbols.metta[output]: Exploration of symbol usage and manipulation.d4_type_prop.metta[output]: Type properties and their applications in logic.c2_spaces_kb.metta[output]: Knowledge base management for spaces.b1_equal_chain.metta[output]: Chain of equalities and logical implications.e1_kb_write.metta[output]: Writing and managing knowledge bases.d3_deptypes.metta[output]: Explorations of dependent types in logic.c3_pln_stv.metta[output]: PLN short-term visit logic and reasoning.d5_auto_types.metta[output]: Automatic type inference and checking.b5_types_prelim.metta[output]: Preliminary studies on types in logic.e3_match_states.metta[output]: State matching and logic testing.d2_higherfunc.metta[output]: Higher-order functions and their applications.b3_direct.metta[output]: Direct methods in logical reasoning and computation.e2_states.metta[output]: State management and logic in complex systems.d1_gadt.metta[output]: Generalized Algebraic Data Types (GADT) exploration.c1_grounded_basic.metta[output]: Grounded basics in logical computation.f1_imports.metta[output]: Importing external logic and data structures.f1_moduleA.metta[output]: Module Af1_moduleB.metta[output]: Module Bf1_moduleC.metta[output]: Module C
a3_twoside.metta[output]: Two-sided logic and reasoning experiments.b2_backchain.metta[output]: Backchaining techniques in logical reasoning.a2_opencoggy.metta[output]: Experiments with OpenCog-like structures.b4_nondeterm.metta[output]: Non-deterministic approaches in logic.c2_spaces.metta[output]: Space(s) handling and reasoning in logic.b0_chaining_prelim.metta[output]: Preliminary chaining methods in logic.
features/bidirectional_computation: Demonstrates bidirectional computation, showcasing how operations can be reversed.reverse-arithmetic.metta[output]: Implements reverse arithmetic operations.reverse-functions.metta[output]: Demonstrates functions operating in reverse.send-more.metta[output]: Solves the SEND+MORE cryptarithmetic puzzle.send-more-money.metta[output]: Tackles the SEND+MORE=MONEY problem with bidirectional computation.
features/containers_are_spaces: Illustrates how containers can act as spatial structures in computation.04_match_list_like_space.metta[output]: Demonstrates list-like space matching.05_match_superpose_element_like_space.metta[output]: Shows superposition in element-like spaces.
features/host_language: Features leveraging the host programming language(s) capabilities.compiler: Compiler-specific features and demonstrations.00a_lang_compiled_case.metta[output]: Explores compiled language case studies.define_if_like.metta[output]: Introduces compiler features for defining 'if'-like structures.
httpclient.metta[output]: Implements a basic HTTP client.
features/loop-checks: Experiments and tests to check for loops in computations.06_loop_0.metta[output]: Basic loop checking.06_loop_1.metta[output]: Intermediate loop checking.06_loop_2.metta[output]: Advanced loop checking.
features/parallelism: Showcases parallel computing with various algorithms and examples.builtins.metta[output]: Built-in parallel computing functions.
performance: Performance tests and benchmarks showcasing optimization and efficiency.factorial.metta[output]: Factorial function implementation and performance testing.factorial.pl[output]: Hand-coded optimized version of the factorial function for speed.fibo-as-pred.metta[output]: Fibonacci sequence implementation as predicates.fibo.metta[output]: Basic Fibonacci sequence implementation.fibonacci.pl[output]: Hand-coded Fibonacci sequence for optimized performance.fwgc1.metta[output]: First version of the Farmer-Wolf-Goat-Cabbage problem.fwgc2.metta[output]: Second version of the problem with enhancements.fwgc3.metta[output]: Third version, further optimized for performance.fwgc.metta[output]: General implementation of the Farmer-Wolf-Goat-Cabbage problem.hanoi-one-space.metta[output]: Tower of Hanoi problem in a single space context.hanoi-peg-space.metta[output]: Tower of Hanoi with multiple pegs and spaces.key-lookups-many.metta[output]: Performance test for key lookups in large datasets.pathfinding-easy-f.metta[output]: Function-based solutions for easy-level pathfinding problems.pathfinding-easy.metta[output]: Easy-level pathfinding problems and solutions.pathfinding-edge.metta[output]: Edge-based pathfinding algorithms and tests.pathfinding-hard-f.metta[output]: Function-based solutions for hard-level pathfinding problems.pathfinding-hard.metta[output]: Hard-level pathfinding problems with complex algorithms.pathfinding-med-f.metta[output]: Medium difficulty pathfinding problems and function-based solutions.state_types.metta[output]: Demonstrations of various state types in logical problems.talk80.metta[output]: Implementation of the classic Talk-80 algorithm for NL parsing and querying.test_infer_function_application_type.metta[output]: Tests for inferring function application types.test_list_concatenation.metta[output]: Tests for list concatenation performance.
known for its pure functional runtime, lazy evaluation, non-garbage collection, and massive parallelism. HVM's beta-optimality allows it, in certain higher-order computations, to be exponentially faster than alternatives, including Haskell's GHC.
-
features/hovm: Demonstrates the capabilities of the Higher-order Virtual Machine (HVM),-
bugs: Bug demonstrations in HVM computations.fib_dups.hvm[output]: Illustrates duplication issues in Fibonacci sequence calculation.fib_loop.hvm[output]: Demonstrates a looping problem in Fibonacci computation.fib_tups.hvm[output]: Showcases tuple-related problems in Fibonacci sequence.lotto.hvm[output]: Presents a bug example in lottery number generation.
-
callcc: Continuation-passing style (CPS) examples in HVM. -
hello: Basic 'Hello World' example in HVM. -
IO: Input/Output operations in HVM.log.hvm[output]: Logging script in HVM.query_and_print.hvm[output]: Script to query and print in HVM.store_and_load.hvm[output]: Demonstrates storing and loading data.
-
lambda: Lambda calculus examples in HVM.multiplication: Multiplication using lambda calculus in HVM.padic_clifford: p-adic numbers and Clifford algebras in HVM.varbase: Variable-based calculations in HVM.
-
queue: Queue implementation in HVM. -
sort: Sorting algorithms implemented in HVM.
-