yiyunliu / mltt-consistencyLinks
Logical relation for predicative CC omega with booleans and an intensional identity type
☆13Updated 6 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:
- Relation algebra library for Coq☆48Updated last month
 - A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 6 months ago
 - Logical Relation for MLTT in Coq☆27Updated 2 weeks ago
 - Building A Correct-By-Construction Proof Checkers For Type Theories☆26Updated 3 weeks ago
 - Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆63Updated last year
 - Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆69Updated last year
 - Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
 - A monadic library for symbolic evaluation☆71Updated 3 months ago
 - An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
 - ☆15Updated 3 months ago
 - An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
 - Implementation of Nuprl's type theory in Coq☆46Updated 11 months ago
 - Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆52Updated last year
 - BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
 - Mechanizations of Type Theories☆32Updated last week
 - A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
 - An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 months ago
 - ☆24Updated 2 weeks ago
 - Library for Classical Coq☆39Updated 5 months ago
 - Ltac2 tutorial☆46Updated 2 years ago
 - Gallina to Bedrock2 compilation toolkit☆62Updated 3 weeks ago
 - Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
 - Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
 - Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆47Updated last year
 - A (formalised) general definition of type theories☆57Updated 4 years ago
 - A proof of Abel-Ruffini theorem.☆30Updated 2 weeks ago
 - This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
 - A Coq library for parametric coinduction☆50Updated 9 months ago
 - ☆56Updated 2 weeks ago
 - A cost-aware logical framework, embedded in Agda.☆67Updated this week