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:
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- ☆13Updated 5 years ago
- Reflection library for Coq☆12Updated 5 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆19Updated this week
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Lenses in Coq☆19Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- A framework for implementing and certifying impure computations in Coq☆52Updated last year
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- ☆18Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- ☆16Updated 3 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆32Updated last year
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago
- All the code I've ever written in Ltac2☆11Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated 11 months ago
- Formalizing nbe in agda☆31Updated 12 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- A fornalisation of Grobner basis in ssreflect☆12Updated last month
- Type Theory with Indexed Equality☆26Updated 8 years ago