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 fornalisation of Grobner basis in ssreflect☆12Updated 4 months ago
- Tactic for polynomial manipulations☆10Updated last year
- 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 9 months ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- ☆12Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- A Coq tactic for proving multivariate inequalities using SDP solvers☆10Updated 2 months ago
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Lenses in Coq☆18Updated 2 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 5 years ago
- ☆18Updated 2 years ago
- ☆14Updated 2 weeks ago
- All the code I've ever written in Ltac2☆11Updated 4 years ago
- Example Coq plugin☆16Updated 7 years ago
- An OCaml EDSL for describing and solving strategic games☆17Updated last year
- Mtac in Agda☆28Updated 4 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 years ago
- ☆16Updated 3 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated last year
- A reflection-based proof tactic for lattices in Coq☆21Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Fintie Sets in Cubical Agda☆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