jyp / nano-AgdaLinks
Tiny type-checker with dependent types
☆78Updated 11 years ago
Alternatives and similar repositories for nano-Agda
Users that are interested in nano-Agda are comparing it to the libraries listed below
Sorting:
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- Where my everyday research happens☆53Updated last month
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- being bits and pieces I'm inclined to leave lying around☆52Updated last week
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- ☆30Updated 7 years ago
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- A library for doing generic programming in Agda☆32Updated 4 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated last week
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- ☆84Updated 7 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- The Prettiest Printer☆35Updated last year
- Recursion schemes for Idris☆65Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last month
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated 11 months ago