vrahli / NuprlInCoqLinks
Implementation of Nuprl's type theory in Coq
☆45Updated 10 months ago
Alternatives and similar repositories for NuprlInCoq
Users that are interested in NuprlInCoq are comparing it to the libraries listed below
Sorting:
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 3 weeks ago
- An enhanced unification algorithm for Coq☆56Updated 5 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- A proof of Abel-Ruffini theorem.☆30Updated 3 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Relation algebra library for Coq☆49Updated 2 weeks ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆63Updated last year
- Constructive Galois connections☆35Updated 7 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- Algebraic Combinatorics in Coq☆39Updated last week
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- ☆84Updated 8 years ago
- A (formalised) general definition of type theories☆57Updated 4 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- Work in progress☆38Updated 3 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 5 months ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆33Updated last year
- ☆30Updated 2 years ago