Pattern Matching via Choice Existential Quantifications in Imperative Languages
Keehang Kwon

TL;DR
The paper introduces a new selection statement called choice existentially quantified statement for pattern matching in imperative languages, demonstrating its usefulness through examples.
Contribution
It proposes a novel selection construct for imperative languages, expanding pattern matching capabilities beyond traditional if-then-else, switch, and try-catch statements.
Findings
New choice existentially quantified statement is useful for pattern matching.
Examples demonstrate practical applications of the new statement.
The approach enhances expressiveness in imperative programming languages.
Abstract
Selection statements -- if-then-else, switch and try-catch -- are commonly used in modern imperative programming languages. We propose another selection statement called a {\it choice existentially quantified statement}. This statement turns out to be quite useful for pattern matching among several merits. Examples will be provided for this statement.
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 · Logic, Reasoning, and Knowledge
