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
- HoTT in Lean 3☆80Updated 5 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 11 months ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- Paper and talk☆54Updated 2 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆76Updated 2 weeks ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- ☆84Updated 8 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆111Updated last month
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 9 months ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 5 months ago
- ☆29Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆61Updated 11 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 3 weeks ago
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated last year
- The Penn Locally Nameless Metatheory Library☆75Updated 5 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated last month
- This aims to be the most pretentious implementation of stlc in existence☆64Updated 3 years ago