bkomuves / nanohs
a self-hosting lambda calculus compiler
☆34Updated 3 years ago
Related projects: ⓘ
- ☆20Updated this week
- A dependent type theory with user defined data types☆46Updated 2 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 3 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆30Updated 2 years ago
- Interpreter for Joy in Haskell using extensible-effects☆34Updated 7 years ago
- Đ (Edh) - The next-big-things ought to happen with Haskell not C/C++☆28Updated 3 months ago
- A proof that Idris is pacman complete☆8Updated 6 years ago
- An extended typed Lambda Calculus☆20Updated last month
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- BDD-based implementation of Datalog☆36Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- A usable type system for call by push-value☆28Updated 4 years ago
- Semi-naïve typed Datalog backend with runtime, transformations, and foreign predicate support☆16Updated 4 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 6 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆20Updated 3 months ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- An interactive interpreter for asynchronous algebraic effects☆12Updated 3 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- A simple functional programming language.☆20Updated 3 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆23Updated 2 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical types☆25Updated this week
- An interpreter of F-ing modules☆18Updated 5 years ago
- ☆25Updated this week
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆26Updated 3 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 6 years ago