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:
- Tactic for polynomial manipulations☆10Updated 2 weeks ago
- a version of the 2048 game for Coq☆22Updated last year
- A fornalisation of Grobner basis in ssreflect☆12Updated 5 months ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 10 months ago
- Formalising session types in Coq☆17Updated 5 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 7 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- ☆12Updated 5 years ago
- Stable sort algorithms and their stability proofs in Coq☆22Updated last month
- Relation algebra library for Coq☆48Updated 2 months ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated 3 months ago
- All the code I've ever written in Ltac2☆11Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 5 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- Formally verified Coq serialization library with support for extraction to OCaml☆23Updated last year
- A Coq tactic for proving multivariate inequalities using SDP solvers☆10Updated 3 months ago
- A generic goal preprocessing tool for proof automation tactics in Coq☆16Updated 6 months ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- ☆18Updated 3 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 7 months ago
- Kleene algebra modulo theories☆27Updated 2 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated 2 weeks ago
- An OCaml EDSL for describing and solving strategic games☆17Updated last year