nbenton / x86provedLinks
☆14Updated 7 years ago
Alternatives and similar repositories for x86proved
Users that are interested in x86proved are comparing it to the libraries listed below
Sorting:
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆32Updated last year
- A proof of Abel-Ruffini theorem.☆30Updated 2 months ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆33Updated 3 months ago
- ☆13Updated 5 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- ☆55Updated 5 months ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 3 months ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆51Updated 11 months 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
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- A framework for implementing and certifying impure computations in Coq☆53Updated last year
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- ☆42Updated 6 years ago
- An enhanced unification algorithm for Coq☆56Updated 5 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 2 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Monadic effects and equational reasoning in Rocq☆72Updated last week
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- Lenses in Coq☆17Updated 2 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago