2013/09/05 by Keehang Kwon, Kwon, Keehang
Computer Science · #Algorithms and Data Compression #FOS: Computer and information sciences #Formal Methods in Verification #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Programming Languages (cs.PL) #cs.PL #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1309.1251
5 pages
arxiv created 2013/09/05 · openalex publication_date 2013/09/05 · arxiv updated 2013/09/06 · openalex created_date 2022/09/30 · openalex updated_date 2026/07/28
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.