jyp / nano-Agda
Tiny type-checker with dependent types
☆76Updated 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
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Where my everyday research happens☆52Updated last week
- The Evolution of a Typechecker☆54Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆44Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- ☆29Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 2 months ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- The Prettiest Printer☆35Updated last year
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 6 months ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- Experiments with sequent calculi☆26Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- ☆45Updated 5 years ago