raaz-crypto / verse-coq
VERified asSembler for cryptographic primitives
☆12Updated last year
Alternatives and similar repositories for verse-coq:
Users that are interested in verse-coq are comparing it to the libraries listed below
- A plugin for Coq that implements the call-by-name forcing translation☆12Updated 3 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated last month
- Formalising session types in Coq☆17Updated 5 years ago
- ☆21Updated 7 years ago
- Lenses in Coq☆17Updated 2 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 6 months ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 8 months ago
- Formally verified Coq serialization library with support for extraction to OCaml☆23Updated last year
- Mtac in Agda☆28Updated 3 years ago
- Type Theory in Type Theory using Cubical Agda☆12Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 5 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆15Updated 4 years ago
- Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]☆13Updated 8 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated 4 months ago
- Coq library for serialization to S-expressions☆18Updated last year
- ☆13Updated 5 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆21Updated 7 months ago
- ☆16Updated 3 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago