AHartNtkn / Dependent-Binary-Lambda-CalculusLinks
A Dependently Typed Esolang
☆10Updated 8 years ago
Alternatives and similar repositories for Dependent-Binary-Lambda-Calculus
Users that are interested in Dependent-Binary-Lambda-Calculus are comparing it to the libraries listed below
Sorting:
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- a self-hosting lambda calculus compiler☆37Updated 5 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- Implementation of dependent type theory in SWI-Prolog☆10Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 10 months ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- My attempt at writing a R⁵RS-compliant Scheme with Megaparsec☆14Updated 3 weeks ago
- Classical Logic in Haskell☆24Updated 5 months ago
- source code for the bondi programming language☆40Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 8 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 5 years ago
- A priliminary backend for Idris that compiles to Clean.☆15Updated 8 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A simple Prolog interpreter☆42Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Edit is a monad for rewriting things.☆23Updated 4 years ago
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16Updated 3 months ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago