gmalecha / coq-ltac-iterLinks
Access hint databases from tactics.
☆12Updated 5 years ago
Alternatives and similar repositories for coq-ltac-iter
Users that are interested in coq-ltac-iter are comparing it to the libraries listed below
Sorting:
- Formal proof in Coq of Banach-Tarski paradox.☆19Updated 3 weeks ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- A framework for extensible, reflective decision procedures.☆19Updated 5 years ago
- Reflection library for Coq☆12Updated 6 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆32Updated 6 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- All the code I've ever written in Ltac2☆11Updated 4 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Example Coq plugin☆18Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated 2 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated 10 months ago
- Library of Unix effects for Coq.☆23Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Lenses in Coq☆17Updated 3 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 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
- Tactic for polynomial manipulations☆12Updated 5 months ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 4 months ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- ☆11Updated 5 years ago
- Formalising session types in Coq☆17Updated 6 years ago