lynn / universal-lambdaLinks
A minimal esolang based on lambda calculus
☆16Updated 4 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 compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- a self-hosting lambda calculus compiler☆37Updated 6 months ago
- Classical Logic in Haskell☆24Updated 6 months ago
- A simple prolog implementation in Rust☆26Updated 4 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 5 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- Linearizability Hoare Logic☆14Updated 6 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- A formalization of System Fω in Agda☆19Updated 7 months ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆48Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- ☆16Updated 3 years ago
- A TOML parser for Idris 2☆16Updated 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
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- A SKI combinators interpreter written in assembly☆19Updated 5 years ago
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆60Updated 4 months ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- A toy dependent typed language.☆32Updated this week
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago