HarrisonGrodin / agda-calfLinks
A cost-aware logical framework, embedded in Agda.
☆67Updated 2 weeks ago
Alternatives and similar repositories for agda-calf
Users that are interested in agda-calf are comparing it to the libraries listed below
Sorting:
- Building A Correct-By-Construction Proof Checkers For Type Theories☆26Updated 2 weeks ago
- An enhanced unification algorithm for Coq☆56Updated 6 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 7 months ago
- Formalizations of Gradually Typed Languages in Agda☆58Updated 8 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- ☆36Updated 4 years ago
- Mechanizations of Type Theories☆32Updated 2 months ago
- ♾️ A library for universe levels and universe polymorphism☆35Updated 2 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 months ago
- Implementation of Nuprl's type theory in Coq☆46Updated 10 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Logical Relation for MLTT in Coq☆27Updated this week
- my phd thesis☆26Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆63Updated last year
- The Iowa Agda Library☆49Updated last month
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- ☆49Updated 2 months ago
- The Penn Locally Nameless Metatheory Library☆76Updated 6 months ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- Relation algebra library for Coq☆49Updated last month
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 5 months ago
- A style guide for Coq☆18Updated 3 years ago
- ☆55Updated 2 weeks ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- A Coq library for parametric coinduction☆50Updated 8 months ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆35Updated last month