rfindler / 395-2013
☆13Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for 395-2013
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- A Unifying Cartesian Cubical Set Model☆33Updated 5 years ago
- ☆12Updated 2 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆45Updated 2 months ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆29Updated 3 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆16Updated 3 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 7 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated 10 months ago
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- A Coq tactic for proving multivariate inequalities using SDP solvers☆9Updated last week
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- Congruence Closure Procedure in Cubical Agda☆16Updated 4 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 11 months ago
- Relation algebra library for Coq☆48Updated last week
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆47Updated last month
- Algebraic Combinatorics in Coq☆36Updated this week
- IO for Gallina☆31Updated 2 months ago
- A proof of Abel-Ruffini theorem.☆28Updated this week
- Implementation of sprintf for Coq☆18Updated 4 years ago