maximedenes / coq-amd64
☆22Updated 8 years ago
Related projects ⓘ
Alternatives and complementary repositories for coq-amd64
- ☆29Updated 9 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 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
- ☆18Updated 7 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- ☆51Updated this week
- Mirror of Conor McBride’s 2011 Agda course materials☆11Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- ☆20Updated 6 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 5 years ago
- secret project☆17Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 4 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A dependently typed type checker for a TT with intervals☆21Updated 4 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- Experiments in Synthetic Differential Geometry☆15Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 5 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 7 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Formal proof in Coq of Banach-Tarski paradox.☆15Updated last month
- Type Theory in Type Theory using Cubical Agda☆12Updated 5 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 11 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- System F in coq.☆19Updated 9 years ago