pigworker / TypesWhoSayNi
being the materials for a paper I have in mind to write about the bidirectional discipline
☆51Updated 9 months ago
Alternatives and similar repositories for TypesWhoSayNi
Users that are interested in TypesWhoSayNi are comparing it to the libraries listed below
Sorting:
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- Where my everyday research happens☆52Updated 2 weeks ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 9 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 5 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago
- NbE course @ Chalmers☆28Updated 7 months ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆57Updated 4 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Compiler backend for generating Scheme code☆26Updated last year
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- ☆45Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- IO using sized types and copatterns☆34Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Staged push/pull fusion with typed Template Haskell☆59Updated last year
- being the materials for Summer 2013's course☆112Updated 2 years ago