rfindler / 395-2013Links
☆14Updated 6 years ago
Alternatives and similar repositories for 395-2013
Users that are interested in 395-2013 are comparing it to the libraries listed below
Sorting:
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 8 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- A proof of Abel-Ruffini theorem.☆30Updated 2 months ago
- Algebraic Combinatorics in Coq☆38Updated 7 months ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆32Updated last year
- Research material of Erik Palmgren (1963–2019)☆21Updated 4 months ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last week
- a version of the 2048 game for Coq☆22Updated last year
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- Relation algebra library for Coq☆49Updated 5 months ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated last year
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago