mb64 / simple-lambda-prologLinks
A simple λProlog interpreter
☆20Updated 3 years ago
Alternatives and similar repositories for simple-lambda-prolog
Users that are interested in simple-lambda-prolog are comparing it to the libraries listed below
Sorting:
- ☆17Updated last year
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆14Updated last year
- A formalization of System Fω in Agda☆17Updated 4 months ago
- Hanoi tower in Coq☆26Updated last month
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- 🪆 A Staged Type Theory☆35Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 months ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Experimental functional language☆17Updated 3 years ago
- A SKI combinators interpreter written in assembly☆20Updated 4 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- ☆17Updated 6 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- A repository of MetaOCaml packages☆13Updated last month
- Matita (proof assistant) with embedded elpi☆13Updated 7 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- 🩺 A library for compiler diagnostics☆46Updated 4 months ago
- Formalising session types in Coq☆17Updated 5 years ago
- Organize mathematical thoughts☆20Updated last year
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- a version of the 2048 game for Coq☆22Updated last year