AHartNtkn / Dependent-Binary-Lambda-CalculusLinks
A Dependently Typed Esolang
☆10Updated 7 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
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Implementation of dependent type theory in SWI-Prolog☆9Updated 4 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- An experimental implementation of a tiny ML-like language using an embedded custom expander (WIP, currently just System F core language)☆21Updated 6 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- Base library for HoTT in Agda☆37Updated 6 years ago
- A browser Pong game, taking advantage of Idris's ability to compile to javascript.☆18Updated 10 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 8 months 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
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Normalization for Gödel's system T using a glueing model construction☆9Updated 3 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- SC Mini is a "minimal" positive supercompiler☆46Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Propositional logic tools, inspired by the Coq standard library.☆9Updated 7 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- A Self-Interpreter for F-omega☆16Updated 9 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- a self-hosting lambda calculus compiler☆36Updated 3 months ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆40Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago