ClairvoyanceMonad
Clairvoyance framework
Formalizes reasoning about lazy computation costs using a simple framework
The Coq formalization of the paper Reasoning about the garden of forking paths.
24 stars
6 watching
2 forks
Language: Coq
last commit: 9 months ago Related projects:
Repository | Description | Stars |
---|---|---|
| A Coq library providing tactics to manipulate hypotheses in formal proofs. | 20 |
| Tool for generating Coq definitions and proofs for locally nameless representations | 30 |
| A comprehensive library of verified data structures and algorithms in Coq | 45 |
| A library for reasoning about randomized algorithms in Coq | 25 |
| A tool for interactive theorem proving and language support in Coq | 153 |
| A comprehensive Coq library providing formal definitions and proofs of rewriting theory, lambda-calculus, and termination. | 35 |
| A Coq library for formalizing and reasoning about monads with equational logic | 70 |
| A formalization of information theory and linear error-correcting codes in Coq. | 64 |
| Formalization of Tarjan and Kosaraju's strongly connected component algorithm in Coq for finite graphs. | 13 |
| A learning environment for theorem proving with the Coq proof assistant | 388 |
| Formalizes mathematics using the univalent point of view | 964 |
| Investigating various aspects of discrete mathematics and formal proofs in Coq, including ordinal numbers and computability theory. | 69 |
| Generates a random Coq program with a graphical tree-like structure | 24 |
| A framework for verifying causal consistency in distributed key-value stores and their clients using the Coq proof assistant | 32 |
| A Coq library for proving properties about stateful systems through parameterized coinduction | 43 |