bkomuves / nanohs
a self-hosting lambda calculus compiler
☆34Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for nanohs
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Dependently typed programming language written in Haskell☆22Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A dependent type theory with user defined data types☆45Updated 3 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆34Updated 3 weeks ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆30Updated 2 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 5 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- 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
- A usable type system for call by push-value☆28Updated 4 years ago
- An interpreter of F-ing modules☆18Updated 5 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 4 years ago
- ICFP tutorial☆40Updated 3 years ago
- An experimental language server for SomewhatML☆24Updated last year
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- A proof that Idris is pacman complete☆8Updated 7 years ago
- 🪆 A Staged Type Theory☆34Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- BDD-based implementation of Datalog☆36Updated 4 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- Miller/pattern unification in Agda☆62Updated 10 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆53Updated 6 months ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical types☆25Updated this week
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- A simple functional programming language.☆21Updated 3 years ago