lynn / universal-lambdaLinks
A minimal esolang based on lambda calculus
☆16Updated 5 years ago
Alternatives and similar repositories for universal-lambda
Users that are interested in universal-lambda are comparing it to the libraries listed below
Sorting:
- a self-hosting lambda calculus compiler☆37Updated 10 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 4 years ago
- dependently-typed lisp with flexible compiler backends☆27Updated 6 years ago
- An experimental language server for SomewhatML☆24Updated 3 years ago
- A simple prolog implementation in Rust☆26Updated 5 years ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 5 years ago
- ☆16Updated 3 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A TOML parser for Idris 2☆17Updated last year
- Linearizability Hoare Logic☆14Updated 10 months ago
- A toy dependent typed language.☆36Updated last week
- A formalization of System Fω in Agda☆20Updated last month
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago
- Idris 2 bindings to various C libraries☆15Updated 4 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆58Updated 5 years ago
- Playing with type systems☆51Updated last year
- an implementation of Observational Type Theory (OTT) and more☆30Updated 3 years ago
- Ideas, documents, and tutorial pile for the Prowl Language☆12Updated last year
- The Functional Virtual Machine.☆14Updated last year
- Minimalist compiler course, based on Essential of Compilation☆11Updated last month
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆65Updated 8 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Abstract krivine machine implementing call-by-name semantics. In OCaml.☆45Updated 7 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated 2 months ago
- ☆17Updated last year
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- A dynamically-typed CBPV language embedded in Racket☆40Updated last year