jyp / nano-Agda
Tiny type-checker with dependent types
☆76Updated 10 years ago
Related projects ⓘ
Alternatives and complementary repositories for nano-Agda
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Where my everyday research happens☆53Updated last week
- ☆28Updated 6 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- A Specification for Dependent Types in Haskell (Core)☆65Updated 2 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- The Prettiest Printer☆35Updated 9 months ago
- being the materials for Summer 2013's course☆110Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆70Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆42Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- Agda formalisation of second-order abstract syntax☆52Updated 2 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- Unification and type inference algorithms☆123Updated 9 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago