plclub / lngen
Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott
☆31Updated 5 months ago
Alternatives and similar repositories for lngen:
Users that are interested in lngen are comparing it to the libraries listed below
- The Penn Locally Nameless Metatheory Library☆74Updated 3 weeks ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆57Updated 6 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 5 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- An interactive theorem prover based on lambda-tree syntax☆94Updated 2 months ago
- Official repository of the Autosubst 2 project.☆20Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- Mechanizations of Type Theories☆28Updated last month
- An enhanced unification algorithm for Coq☆55Updated this week
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago
- Towards changing things and see if it proofs☆59Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago
- ☆21Updated 3 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- A Coq library for parametric coinduction☆46Updated 2 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 7 months ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Agda programming with holes☆27Updated 4 years ago
- ☆45Updated 5 years ago
- Logical Relation for MLTT in Coq☆24Updated last week
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago