plclub / lngenLinks
Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott
☆32Updated last year
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☆76Updated 9 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆48Updated 3 weeks ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Mechanizations of Type Theories☆32Updated this week
- Correctness of normalization-by-evaluation for STLC☆24Updated 6 years ago
- Linear Logic for Constructive Mathematics, in Agda☆18Updated 6 years ago
- A Coq library for parametric coinduction☆51Updated 11 months ago
- Official repository of the Autosubst 2 project.☆25Updated 2 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆103Updated 5 months ago
- Unification and type inference algorithms☆127Updated 10 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated this week
- ☆28Updated 5 years ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 9 months ago
- A TACtic library for Agda☆50Updated last year
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 3 weeks ago
- ☆31Updated 2 years ago
- Proof automation – for Agda, in Agda.☆45Updated 5 years ago
- Agda programming with holes☆28Updated 4 years ago
- ☆45Updated 6 years ago
- A formalized proof of a version of the initiality conjecture☆45Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago