pi8027 / efficient-finfun
☆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
- a version of the 2048 game for Coq☆22Updated last year
- A fornalisation of Grobner basis in ssreflect☆12Updated 2 months ago
- Tactic for polynomial manipulations☆10Updated last year
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- Lenses in Coq☆16Updated 2 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 6 months ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- ☆13Updated last month
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- ☆18Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Implementation of sprintf for Coq☆18Updated 4 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 5 years ago
- Mtac in Agda☆28Updated 3 years ago
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- A Coq tactic for proving multivariate inequalities using SDP solvers☆10Updated last week
- All the code I've ever written in Ltac2☆11Updated 4 years ago
- ☆12Updated 5 years ago
- A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.☆15Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated 2 weeks ago
- ☆11Updated 4 years ago
- Relation algebra library for Coq☆48Updated 2 weeks ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Research material of Erik Palmgren (1963–2019)☆20Updated last year
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago