plclub / lngenLinks
Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott
☆32Updated 8 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 3 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 9 months ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Mechanizations of Type Theories☆30Updated this week
- 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
- Official repository of the Autosubst 2 project.☆23Updated 2 years ago
- Agda programming with holes☆27Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 9 months ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Towards changing things and see if it proofs☆60Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆100Updated 9 months ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆21Updated this week
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago
- Correctness of normalization-by-evaluation for STLC☆23Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 7 months ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 5 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 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
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- ☆27Updated 5 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A Coq library for parametric coinduction☆50Updated 5 months ago
- F-omega with interval kinds mechanized in Agda☆13Updated 11 months ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago