jyp / nano-Agda
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
- The Evolution of a Typechecker☆54Updated 6 years ago
- Where my everyday research happens☆52Updated this week
- IO using sized types and copatterns☆34Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- ☆30Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 4 months ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- Recursion schemes for Idris☆64Updated 6 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- GRIN backend for Idris☆51Updated 5 years ago
- ☆45Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 5 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 5 years ago
- Work in progress☆34Updated 5 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆48Updated 3 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago