jldodds / coq-lean-cheatsheetLinks
A quick reference for mapping Coq tactics to Lean tactics
☆72Updated 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:
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- HoTT in Lean 3☆82Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Paper and talk☆55Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- ☆84Updated 8 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- A formalized proof of a version of the initiality conjecture☆43Updated 5 years ago
- An enhanced unification algorithm for Coq☆56Updated 6 months ago
- ☆30Updated 2 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 3 months ago
- Where my everyday research happens☆55Updated last week
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 6 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated 10 months ago
- Toy typechecker for Insanely Dependent Types☆82Updated last week
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- A TACtic library for Agda☆50Updated last year
- What I wish I knew when learning HoTT☆53Updated 6 years ago