gallais / generic-syntax
A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
☆72Updated 3 years ago
Alternatives and similar repositories for generic-syntax:
Users that are interested in generic-syntax are comparing it to the libraries listed below
- Where my everyday research happens☆52Updated last month
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Formalizing nbe in agda☆30Updated 12 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- Mtac in Agda☆28Updated 3 years ago
- ☆30Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Tiny type-checker with dependent types☆77Updated 11 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A TACtic library for Agda☆48Updated 6 months ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Simplified Observational Type Theory☆81Updated last year
- The Evolution of a Typechecker☆54Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Work in progress☆34Updated 4 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 8 months ago
- ☆84Updated 7 years ago