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☆75Updated 3 years ago
- Where my everyday research happens☆54Updated 2 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 11 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- ☆32Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- being bits and pieces I'm inclined to leave lying around☆53Updated last month
- The Evolution of a Typechecker☆54Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- ☆84Updated 7 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- The Prettiest Printer☆35Updated last year