mattam82 / ConstructorsLinks
Example Coq plugin
☆17Updated 7 years ago
Alternatives and similar repositories for Constructors
Users that are interested in Constructors are comparing it to the libraries listed below
Sorting:
- All the code I've ever written in Ltac2☆11Updated 4 years ago
- Tactic for polynomial manipulations☆10Updated 2 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Coq library for handling names☆19Updated 2 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated last month
- Formal proof in Coq of Banach-Tarski paradox.☆16Updated 2 months ago
- Implementation of sprintf for Coq☆18Updated 5 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 Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- An OCaml EDSL for describing and solving strategic games☆17Updated last year
- Reflection library for Coq☆12Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- flexible 'let rec' generation for MetaOCaml☆26Updated 2 months ago
- ☆13Updated 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
- Formalising session types in Coq☆17Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Lenses in Coq☆19Updated 2 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- ☆11Updated 5 years ago
- A framework for extensible, reflective decision procedures.☆19Updated 5 years ago
- A Coq plugin that implements exceptions in Coq☆14Updated 4 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 6 years ago
- ☆27Updated 5 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Verified NbE via gluing in Agda☆11Updated last year
- 👹 A library for hierarchical names and lexical scoping☆26Updated 9 months ago