maximedenes / coq-amd64
☆22Updated 9 years ago
Alternatives and similar repositories for coq-amd64:
Users that are interested in coq-amd64 are comparing it to the libraries listed below
- ☆29Updated 9 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- ☆21Updated 7 years ago
- ☆18Updated 7 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 weeks ago
- secret project☆17Updated 7 years ago
- Foundational Verification of Hybrid Systems☆15Updated 8 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Formally verified Coq serialization library with support for extraction to OCaml☆23Updated last year
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 3 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- ☆55Updated 2 weeks ago
- IO using sized types and copatterns☆33Updated 4 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- ☆17Updated 6 years ago
- Type Theory in Type Theory using Cubical Agda☆12Updated 6 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago