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:
- Where my everyday research happens☆55Updated this week
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- The Prettiest Printer☆35Updated last year
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆113Updated 5 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Simplified Observational Type Theory☆86Updated 2 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 5 months ago
- ☆32Updated 7 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- ☆84Updated 8 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 7 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago