rfindler / 395-2013
☆13Updated 5 years ago
Alternatives and similar repositories for 395-2013:
Users that are interested in 395-2013 are comparing it to the libraries listed below
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆44Updated 2 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆16Updated 3 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- ☆12Updated 3 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 6 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Algebraic Combinatorics in Coq☆38Updated last month
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- F-omega with interval kinds mechanized in Agda☆13Updated 6 months ago
- Implementation of sprintf for Coq☆18Updated 4 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 2 years ago
- Work in progress☆34Updated 2 months ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- A proof of Abel-Ruffini theorem.☆28Updated this week
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- A simple supercompiler formally verified in Agda☆32Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago