
TL;DR
This paper explores leveraging computational effects to enhance scalability in specifications, demonstrating that effect-based specifications can be reasoned about without explicitly including the effects in the deduction system.
Contribution
It introduces a method to design deduction systems for effect-involving specifications without explicitly modeling the effects, improving scalability and correctness.
Findings
Effect-based specifications become more complex but more correct.
Deduction systems can handle effects implicitly.
The approach is demonstrated through two fundamental examples.
Abstract
This note is about using computational effects for scalability. With this method, the specification gets more and more complex while its semantics gets more and more correct. We show, from two fundamental examples, that it is possible to design a deduction system for a specification involving an effect without expliciting this effect.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Parallel Computing and Optimization Techniques · Formal Methods in Verification
