CoqHott / coq-forcing
A plugin for Coq that implements the call-by-name forcing translation
☆12Updated 3 years ago
Alternatives and similar repositories for coq-forcing:
Users that are interested in coq-forcing are comparing it to the libraries listed below
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆24Updated 3 weeks ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 6 months ago
- Coq library for serialization to S-expressions☆18Updated last year
- Type theory in type theory☆16Updated 13 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
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆31Updated 2 months ago
- Revised Omega-categorical Typechecker☆26Updated 5 months ago
- ☆18Updated 2 years ago
- VERified asSembler for cryptographic primitives☆12Updated last year
- Experimentation project☆16Updated 11 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 weeks ago
- a version of the 2048 game for Coq☆22Updated last year
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- Deciding Presburger arithmetic in agda☆31Updated 2 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- A fornalisation of Grobner basis in ssreflect☆12Updated 4 months ago
- A Coq library providing tactics to deal with hypothesis☆21Updated 4 months ago
- Intrinsic Verification of Formal Grammar Theory☆19Updated this week
- ☆18Updated 3 years ago
- A repository of MetaOCaml packages☆12Updated last year
- Implementation of Nuprl's type theory in Coq☆45Updated 4 months ago
- Lenses in Coq☆18Updated 2 years ago
- ☆17Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- Multinomials for the Mathematical Components library.☆14Updated last week
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- Mtac in Agda☆28Updated 3 years ago
- Coherence typechecker for infinity categories☆19Updated 2 months ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆21Updated 7 months ago
- A reflection-based proof tactic for lattices in Coq☆21Updated last year