tromp / AIT
Algorithmic Information Theory, using Binary Lambda Calculus
☆157Updated last week
Alternatives and similar repositories for AIT:
Users that are interested in AIT are comparing it to the libraries listed below
- The cuteness implementation of a dependently typed language.☆190Updated 2 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆70Updated 8 years ago
- Dependently-typed language with Iverson-style implicit lifting☆121Updated 5 years ago
- Catalog of visual lambda calculi☆129Updated last week
- Collapsing Towers of Interpreters☆90Updated last year
- metamath proof enumerators and other things☆92Updated 8 months ago
- An efficient implementation of the higher-order logic programming language Lambda Prolog☆155Updated 11 months ago
- The Makam Metalanguage☆198Updated 2 years ago
- APL Compiler targeting a typed array intermediate language☆211Updated 7 months ago
- Embeddable Lambda Prolog Interpreter☆309Updated last week
- A categorical programming language with effects☆276Updated 2 years ago
- Automatically exported from code.google.com/p/ghilbert☆48Updated 7 years ago
- Programming with pure lambda calculus☆105Updated last month
- Inpla: Interaction nets as a programming language (the current version)☆298Updated 5 months ago
- Metamath Zero specification language☆337Updated 4 months ago
- A less devious proof assistant☆224Updated 2 years ago
- Optimal evaluator of λ-calculus terms.☆275Updated 2 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆377Updated last year
- Animations of lambda term reduction sequences☆128Updated 6 years ago
- The adventures of a Haskell compiler☆223Updated 4 months ago
- Proofs in Coq for the book Reflective Programs in Tree Calculus☆170Updated 3 years ago
- An interpreter for a J-inspired language☆90Updated last year
- 3-lisp implementation from Procedural Reflection in Programming Languages, volume i., Brian Cantwell Smith☆111Updated last week
- Beautiful, interactive visualizations of logical inference☆148Updated 4 years ago
- A strict, impure, curried, partially applied programming language with rather peculiar syntax.☆281Updated 11 years ago
- A formalization of geometry in Coq based on Tarski's axiom system☆193Updated 2 months ago
- A proof assistant for general type theories☆302Updated 6 months ago
- an implementation of stuck macros☆139Updated last month
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆125Updated last year
- Voevodsky's original development of the univalent foundations of mathematics in Coq☆243Updated 10 years ago