2000 character limit reached
Pattern Matching via Choice Existential Quantifications in Imperative Languages
Published 5 Sep 2013 in cs.PL | (1309.1251v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.