plclub / lngen
Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott
☆31Updated 6 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 last month
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 7 months ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago
- Mechanizations of Type Theories☆28Updated 2 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 5 years ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated 3 months ago
- Unification and type inference algorithms☆125Updated 10 years ago
- An enhanced unification algorithm for Coq☆56Updated 3 weeks ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆81Updated 4 years ago
- Formalisation of Goedel's System T in Coq☆15Updated 13 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated last month
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- A cost-aware logical framework, embedded in Agda.☆61Updated 8 months ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆45Updated 2 weeks ago
- ☆82Updated 11 months ago
- Agda programming with holes☆27Updated 4 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- ☆27Updated 4 years ago
- Official repository of the Autosubst 2 project.☆20Updated last year
- Adding extensions to DOT calculus☆23Updated 5 years ago
- Notes and handouts from OPLSS 2018☆55Updated 6 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 3 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- ☆45Updated 5 years ago