DistributedComponents / InfSeqExtLinks
A Coq library for reasoning (co)inductively on infinite sequences using LTL-like modal operators
☆17Updated 2 years ago
Alternatives and similar repositories for InfSeqExt
Users that are interested in InfSeqExt are comparing it to the libraries listed below
Sorting:
- An implementation of the Chord lookup protocol verified in Coq using the Verdi framework☆10Updated 6 years ago
- Coq library for serialization to S-expressions☆19Updated last year
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated 8 months ago
- a version of the 2048 game for Coq☆22Updated last year
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 8 years ago
- Essentials of Programming Languages, with OCaml implementations & Coq proofs☆32Updated 8 years ago
- Partial Commutative Monoids☆28Updated 2 weeks ago
- A termination checker for higher-order rewriting with dependent types☆10Updated 5 years ago
- Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on☆22Updated last year
- Formalization of Wigderson's graph coloring algorithm in Coq☆9Updated last year
- Library of Coq proof automation☆16Updated 3 years ago
- Implementations of various toy programming languages☆12Updated 7 years ago
- Luck -- A Language for Property-Based Generators☆35Updated 3 months ago
- Formalization of termination of Gödel's System T☆9Updated 4 years ago
- A proof of Abel-Ruffini theorem.☆29Updated this week
- Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components …☆17Updated last week
- Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2020☆19Updated 5 years ago
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 7 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆44Updated 2 months ago
- Dafny for Metatheory of Programming Languages☆25Updated last month
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct☆16Updated 10 months ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆25Updated 5 months ago
- Optimizing Abstract Abstract Machines☆31Updated 8 years ago
- A Tutorial on Reflecting in Coq the generation of Hoare proof obligations [maintainer=@k4rtik]☆21Updated 3 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago
- Graded Dependent Type systems☆24Updated last year
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆25Updated 2 months ago