yiyunliu / mltt-consistencyLinks
Logical relation for predicative CC omega with booleans and an intensional identity type
☆12Updated 8 months ago
Alternatives and similar repositories for mltt-consistency
Users that are interested in mltt-consistency are comparing it to the libraries listed below
Sorting:
- Logical Relation for MLTT in Coq☆28Updated 3 weeks ago
- Relation algebra library for Coq☆49Updated 3 weeks ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated this week
- A monadic library for symbolic evaluation☆73Updated 5 months ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 7 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- Mechanizations of Type Theories☆32Updated last week
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- antifunext☆34Updated last year
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆69Updated last year
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆48Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 months ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- A (formalised) general definition of type theories☆58Updated 4 years ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆52Updated last year
- A cost-aware logical framework, embedded in Agda.☆68Updated last month
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆71Updated last year
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆38Updated 3 months ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 4 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- Library for Classical Coq☆40Updated 7 months ago
- Synthetic geometry. Probably mostly algebraic geometry.☆25Updated last year
- ☆15Updated 4 months ago
- Lecture notes on realizability☆75Updated 10 months ago