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
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- 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
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- A browser Pong game, taking advantage of Idris's ability to compile to javascript.☆18Updated 10 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- My attempt at writing a R⁵RS-compliant Scheme with Megaparsec☆14Updated 2 months ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- a self-hosting lambda calculus compiler☆37Updated 6 months ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Interactive Theorem Proving for students☆20Updated 2 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A Self-Interpreter for F-omega☆16Updated 9 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 11 months ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Morte IDE☆29Updated 6 months ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Experiments with effect systems☆12Updated 9 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Updated 5 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- A dependently typed type checker for a TT with intervals☆23Updated 5 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
- Classical Logic in Haskell☆24Updated 6 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- ☆12Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Session types in Idris2!☆27Updated 4 years ago