marvinborner / BLoCLinks
File format and optimizer for programs encoded in binary lambda calculus
☆16Updated last year
Alternatives and similar repositories for BLoC
Users that are interested in BLoC are comparing it to the libraries listed below
Sorting:
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- a self-hosting lambda calculus compiler☆37Updated 5 months ago
- An implementation of interaction nets as a forth-like language.☆38Updated last month
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Linearizability Hoare Logic☆14Updated 5 months ago
- A formalization of System Fω in Agda☆19Updated 7 months ago
- A Lévy-optimal lambda calculus reducer with a backdoor to C☆32Updated this week
- Implementing a small functional language with a combinator based graph-reduction machine☆36Updated last week
- Polymorphic guarded λ-calculus☆20Updated last month
- Programming with pure lambda calculus☆120Updated last week
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- MIRROR of https://codeberg.org/catseye/Vinegar : A semi-concatenative language where every operation can fail☆15Updated last year
- koneko - a concatenative not-quite-lisp for kittens☆25Updated last year
- Martin-Löf type theory + W-types implemented in C (WIP)☆25Updated last month
- ☆39Updated 2 years ago
- A self-hosting mini Haskell compiler with a mini C runtime.☆76Updated 5 years ago
- SKI combinators☆55Updated 8 years ago
- A formally verified compiler of untyped lambda calculus to brainfuck☆14Updated 8 years ago
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆59Updated 3 months ago
- A toy dependent typed language.☆32Updated last week
- ☆24Updated 3 years ago
- dependently-typed lisp with flexible compiler backends☆27Updated 6 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Updated 2 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- ☆16Updated 3 years ago
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- Journey to the Center of the Lambda Calculus☆15Updated 2 years ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago