bkomuves / nanohs
a self-hosting lambda calculus compiler
☆35Updated last week
Alternatives and similar repositories for nanohs:
Users that are interested in nanohs are comparing it to the libraries listed below
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A SKI combinators interpreter written in assembly☆20Updated 4 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆10Updated 11 months ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Lambda Calculus with quote and unquote☆19Updated 4 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 9 months ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 4 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- SPJ's tutorial on implementing functional languages☆28Updated 5 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- Linear map categories in Agda☆5Updated last year
- A usable type system for call by push-value☆33Updated 5 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
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 5 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A toy dependent typed language.☆28Updated last week
- An interpreter of F-ing modules☆19Updated 5 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 6 years ago
- An extended typed Lambda Calculus☆21Updated 8 months ago
- The Alms Programming Language☆44Updated 6 years ago