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:
- A small NuPRL style proof assistant☆31Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 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
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- a self-hosting lambda calculus compiler☆37Updated 9 months ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Updated 5 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Edit is a monad for rewriting things.☆23Updated 5 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- Classical Logic in Haskell☆24Updated 2 months ago
- Base library for HoTT in Agda☆38Updated 6 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- Cur dependently-typed language in miniKanren.☆17Updated 8 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆36Updated last year
- My attempt at writing a R⁵RS-compliant Scheme with Megaparsec☆14Updated last month
- IO using sized types and copatterns☆36Updated 4 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- SC Mini is a "minimal" positive supercompiler☆48Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆24Updated 5 years ago