jldodds / coq-lean-cheatsheetLinks
A quick reference for mapping Coq tactics to Lean tactics
☆71Updated 4 years ago
Alternatives and similar repositories for coq-lean-cheatsheet
Users that are interested in coq-lean-cheatsheet are comparing it to the libraries listed below
Sorting:
- HoTT in Lean 3☆81Updated 5 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 8 years ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 10 months ago
- A (formalised) general definition of type theories☆59Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- Paper and talk☆55Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 5 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- The Penn Locally Nameless Metatheory Library☆76Updated 10 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- ☆86Updated 8 years ago
- Proof automation – for Agda, in Agda.☆45Updated 5 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- A formalized proof of a version of the initiality conjecture☆45Updated 5 years ago
- An enhanced unification algorithm for Coq☆58Updated 2 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆68Updated last year
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆48Updated last month
- Prototype implementations of systems based on setoid type theory☆66Updated 5 years ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 7 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆52Updated last year