UCSD-PL / veridroneLinks
Foundational Verification of Hybrid Systems
☆15Updated 8 years ago
Alternatives and similar repositories for veridrone
Users that are interested in veridrone are comparing it to the libraries listed below
Sorting:
- ☆13Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- ☆21Updated 9 years ago
- Lenses in Coq☆17Updated 3 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- Reflection library for Coq☆12Updated 6 years ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 4 years ago
- Formally verified Coq serialization library with support for extraction to OCaml☆24Updated 2 years ago
- A fornalisation of Grobner basis in ssreflect☆12Updated last week
- Formal topology (and some probability) in Coq☆31Updated 7 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆21Updated 10 years ago
- A framework for extensible, reflective decision procedures.☆19Updated 6 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆32Updated 6 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆36Updated 3 months ago
- Tactic for polynomial manipulations☆12Updated last week
- ☆29Updated 10 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Updated last year
- 🌳 Generate a fresh bonsai in your terminal☆30Updated 4 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Selective applicative functors laws and theorems☆15Updated 5 years ago
- Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]☆38Updated 2 years ago
- Implementation of sprintf for Coq☆18Updated 5 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
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆28Updated 2 years ago
- Robots powered by Constructive Reals☆34Updated 8 years ago
- A framework for implementing and certifying impure computations in Coq☆53Updated 2 years ago
- Formalising session types in Coq☆17Updated 6 years ago
- Collaborative work on reversible computing☆25Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 7 years ago