bkomuves / nanohs
a self-hosting lambda calculus compiler
☆34Updated 3 years ago
Alternatives and similar repositories for nanohs:
Users that are interested in nanohs are comparing it to the libraries listed below
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 2 months ago
- A toy dependent typed language.☆28Updated this week
- An interpreter of F-ing modules☆18Updated 5 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years 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
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 3 months ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 2 years ago
- Lua backend for Idris 2☆27Updated 2 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- 🪆 A Staged Type Theory☆34Updated last year
- ICFP tutorial☆39Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 6 years ago
- Anders: Cubical Type Checker☆22Updated last year
- A small NuPRL style proof assistant☆31Updated 6 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- Experimental functional language☆17Updated 2 years ago
- Funny little Haskell impl☆18Updated 4 years ago