Rewriting with a Nondeterministic Choice Operator: From Algebra to Proofs
Abstract elided by the publisher.
Related papers
- A trustful monad for axiomatic reasoning with probability and nondeterminism JFP 2021
- Step-Indexed Logical Relations for Countable Nondeterminism and Probabilistic Choice POPL 2023
- Outcome Logic: A Unified Approach to the Metatheory of Program Logics with Branching Effects TOPLAS 2025
- Smooth, Integrated Proofs of Cryptographic Constant Time for Nondeterministic Programs and Compilers PLDI 2025
- Extracting total Amb programs from proofs ESOP 2022
- Adding Fair Choice to Dijkstra's Calculus TOPLAS 1994
- Positive Almost-Sure Termination: Complexity and Proof Rules POPL 2024
- Shoggoth: A Formal Foundation for Strategic Rewriting POPL 2024