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:
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- 👹 A library for hierarchical names and lexical scoping☆26Updated 2 weeks ago
- ☆17Updated 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
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 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
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- Experimental type-checker for internally parametric type theory☆32Updated 5 months ago
- 🪆 A Staged Type Theory☆35Updated last year
- A formalization of System Fω in Agda☆19Updated 6 months ago
- ☆13Updated last month
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- haha I'm graduating☆14Updated 4 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated 3 weeks ago
- Spartan implementation of H.O.T.T.☆25Updated 3 years ago
- Organize mathematical thoughts☆20Updated last year
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated 2 weeks ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- A type theory with native support for Polynomial Functors.☆39Updated last year
- a self-hosting lambda calculus compiler☆37Updated 5 months ago