mb64 / simple-lambda-prolog
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
- 🪆 A Staged Type Theory☆35Updated last year
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Experimental functional language☆17Updated 2 years ago
- 🩺 A library for compiler diagnostics☆43Updated 2 months ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- ☆17Updated last year
- flexible 'let rec' generation for MetaOCaml☆26Updated last year
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆13Updated last year
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- A repository of MetaOCaml packages☆12Updated last year
- a version of the 2048 game for Coq☆22Updated last year
- A formalization of System Fω in Agda☆17Updated 2 months ago
- Hanoi tower in Coq☆25Updated 4 months ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 weeks 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
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Higher kinded polymorphism in SML☆15Updated 4 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆28Updated 3 weeks ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Organize mathematical thoughts☆20Updated last year
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆10Updated 11 months ago
- A simple supercompiler formally verified in Agda☆33Updated 8 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 6 months ago