Writing Positive/Negative-Conditional Equations Conveniently
Claus-Peter Wirth, Ruediger Lunde

TL;DR
The paper introduces a higher-level notation for positive/negative-conditional equations, simplifying their writing by merging rules through macro-constructs and translating them into formal equations.
Contribution
It presents a macro-rule-construct that allows more convenient and higher-level specification of conditional equations, with an automated translation into formal equations.
Findings
Enhanced notation simplifies writing conditional equations.
Automated translation into formal equations improves usability.
Supports merging multiple rules for the same function.
Abstract
We present a convenient notation for positive/negative-conditional equations. The idea is to merge rules specifying the same function by using case-, if-, match-, and let-expressions. Based on the presented macro-rule-construct, positive/negative-conditional equational specifications can be written on a higher level. A rewrite system translates the macro-rule-constructs into positive/negative-conditional equations.
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 · Formal Methods in Verification · Model-Driven Software Engineering Techniques
