pi8027 / efficient-finfun
☆13Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for efficient-finfun
- Tactic for polynomial manipulations☆10Updated 9 months ago
- A fornalisation of Grobner basis in ssreflect☆12Updated last year
- a version of the 2048 game for Coq☆22Updated last year
- Formalising session types in Coq☆17Updated 5 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆29Updated 3 months 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 3 years ago
- A Coq tactic for proving multivariate inequalities using SDP solvers☆9Updated 2 weeks ago
- Implementation of sprintf for Coq☆18Updated 4 years ago
- Lenses in Coq☆16Updated 2 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- ☆18Updated 2 years ago
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- ☆13Updated 4 months ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆29Updated 2 weeks ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆14Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- All the code I've ever written in Ltac2☆11Updated 3 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
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated last month
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- Libraries demonstrating design patterns for programming and proving with canonical structures in Coq [maintainer=@anton-trunov]☆26Updated last week
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Stable sort algorithms and their stability proofs in Coq☆22Updated 2 months ago
- Coq library for handling names☆18Updated 2 years ago
- ☆11Updated 4 years ago