bkomuves / nanohs
a self-hosting lambda calculus compiler
☆35Updated last month
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
- Quantitative Type Theory implementation☆54Updated 3 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 10 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆29Updated 4 years ago
- A toy dependent typed language.☆28Updated last week
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- A SKI combinators interpreter written in assembly☆20Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆48Updated 3 years ago
- Experimental functional language☆17Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 5 months ago
- Kempe is a compiled stack-based language☆58Updated 7 months ago
- An experimental implementation of a tiny ML-like language using an embedded custom expander (WIP, currently just System F core language)☆21Updated 6 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- dependently-typed lisp with flexible compiler backends☆27Updated 5 years ago
- Yoneda lemma in every known language☆17Updated 2 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated this week
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 6 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- Lua backend for Idris 2☆27Updated 2 years ago