raaz-crypto / verse-coqLinks
VERified asSembler for cryptographic primitives
☆12Updated 2 years ago
Alternatives and similar repositories for verse-coq
Users that are interested in verse-coq are comparing it to the libraries listed below
Sorting:
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 7 years ago
- ☆16Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Reflection library for Coq☆12Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 11 years ago
- A framework for implementing and certifying impure computations in Coq☆53Updated last year
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated last year
- ☆13Updated 6 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- ☆18Updated 3 years ago
- The multimode presheaf proof-assistant☆37Updated 2 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 7 months ago
- Mtac in Agda☆29Updated 4 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Formal proof in Coq of Banach-Tarski paradox.☆19Updated last week
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Logical relations proof in Agda☆27Updated 10 years ago