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
- 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 compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- A toy dependent typed language.☆28Updated 2 weeks ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- An interpreter of F-ing modules☆18Updated 5 years ago
- The Alms Programming Language☆44Updated 6 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- Đ (Edh) - The next-big-things ought to happen with Haskell not C/C++☆28Updated 9 months ago
- Experimental functional language☆17Updated 2 years ago
- A SKI combinators interpreter written in assembly☆19Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 3 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 3 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 2 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- ☆17Updated 11 months ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A simple λProlog interpreter☆20Updated 3 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 8 months ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago