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:
- a version of the 2048 game for Coq☆22Updated last year
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 11 months ago
- Tactic for polynomial manipulations☆10Updated last month
- A fornalisation of Grobner basis in ssreflect☆12Updated this week
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- A Coq plugin that implements exceptions in Coq☆14Updated 4 years ago
- Lenses in Coq☆19Updated 2 years ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- Formal Semantics for Why3☆18Updated this week
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated last month
- ☆16Updated 3 weeks ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 6 years ago
- Partial Commutative Monoids☆28Updated last month
- Relation algebra library for Coq☆48Updated 3 months ago
- IO for Gallina☆33Updated 2 weeks ago
- Coq library on rewriting theory and termination☆36Updated last month
- 👹 A library for hierarchical names and lexical scoping☆26Updated 9 months ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Quasi-quoting library for agda☆17Updated 7 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- ☆12Updated 5 years ago
- A Formal Library about Elliptic Curves for the Mathematical Components Library.☆15Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated last month
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆45Updated 2 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago