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 fornalisation of Grobner basis in ssreflect☆12Updated 6 months ago
- a version of the 2048 game for Coq☆22Updated last year
- Tactic for polynomial manipulations☆10Updated last month
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 10 months ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- All the code I've ever written in Ltac2☆11Updated 4 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆24Updated 5 months ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- ☆15Updated this week
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- A generic goal preprocessing tool for proof automation tactics in Coq☆16Updated 6 months ago
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated last month
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- ☆18Updated 3 years ago
- A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.☆16Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated 2 weeks ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- A simple and portable floating-point interval arithmetic library in OCaml☆10Updated 3 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Updated 8 years ago
- ☆11Updated 4 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- Quasi-quoting library for agda☆17Updated 6 months ago