plclub / lngenLinks
Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott
☆32Updated 9 months ago
Alternatives and similar repositories for lngen
Users that are interested in lngen are comparing it to the libraries listed below
Sorting:
- The Penn Locally Nameless Metatheory Library☆75Updated 4 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 10 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Mechanizations of Type Theories☆30Updated 3 weeks ago
- Logical relations proof in Agda☆27Updated 10 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 2 months ago
- Official repository of the Autosubst 2 project.☆23Updated 2 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 8 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆45Updated 3 months ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Collection of scripts to improve the output of coqdoc [maintainers=@chdoc,@palmskog]☆40Updated last year
- Library to create Coq record update functions☆48Updated 3 weeks ago
- A quick reference for mapping Coq tactics to Lean tactics☆72Updated 4 years ago
- Correctness of normalization-by-evaluation for STLC☆23Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A Coq library for parametric coinduction☆50Updated 6 months ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- This aims to be the most pretentious implementation of stlc in existence☆63Updated 3 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A formalized proof of a version of the initiality conjecture☆43Updated 4 years ago
- An enhanced unification algorithm for Coq☆56Updated 3 months ago
- Towards changing things and see if it proofs☆60Updated 4 years ago
- Formalisation of Goedel's System T in Coq☆15Updated 14 years ago
- Logical Relation for MLTT in Coq☆27Updated 3 weeks ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- Agda bindings to SMT-LIB2 compatible solvers.☆101Updated 9 months ago