pi8027 / efficient-finfunLinks
☆13Updated 5 years ago
Alternatives and similar repositories for efficient-finfun
Users that are interested in efficient-finfun 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…☆33Updated last year
- A fornalisation of Grobner basis in ssreflect☆12Updated 2 months ago
- Tactic for polynomial manipulations☆12Updated 4 months ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- Lenses in Coq☆17Updated 3 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Formally verified Coq serialization library with support for extraction to OCaml☆24Updated last year
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- a version of the 2048 game for Coq☆22Updated last year
- 👹 A library for hierarchical names and lexical scoping☆26Updated last month
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆32Updated 6 years ago
- Formalising session types in Coq☆17Updated 6 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Updated 11 months ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆34Updated last week
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- All the code I've ever written in Ltac2☆11Updated 4 years ago
- Relation algebra library for Coq☆49Updated 2 weeks ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Partial Commutative Monoids☆29Updated 3 months ago
- ☆16Updated 3 months ago
- ☆55Updated last week
- A framework for extensible, reflective decision procedures.☆19Updated 5 years ago
- IO for Gallina☆33Updated 3 months ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated 3 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 6 months ago