The regular-language semantics of second-order idealized ALGOL

DOI10.1016/S0304-3975(03)00315-3zbMath1070.68083OpenAlexW1996612506MaRDI QIDQ1884909

Guy McCusker, Dan R. Ghica

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00315-3

zbMATH Keywords

Game semanticsRegular languagesALGOL-like languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items

Geometry of Synthesis II: From Games to Delay-Insensitive Circuits ⋮ Verifying annotated program families using symbolic game semantics ⋮ Latent semantic analysis of game models using LSTM ⋮ Unnamed Item ⋮ Weighted models for higher-order computation ⋮ From Qualitative to Quantitative Semantics ⋮ Program verification using symbolic game semantics ⋮ A Fragment of ML Decidable by Visibly Pushdown Automata ⋮ A game semantics of names and pointers ⋮ Decidability and syntactic control of interference ⋮ Functions with local state: regularity and undecidability ⋮ Compositional Predicate Abstraction from Game Semantics ⋮ On-the-Fly Techniques for Game-Based Software Model Checking ⋮ Games for complexity of second-order call-by-name programs ⋮ Definability and Full Abstraction ⋮ A calculus of coroutines

Cites Work

• Extending regular expressions with iterated shuffle
• Mathematical foundations of programming semantics. Proceedings of the 11th conference (MFPS), Tulane Univ., New Orleans, LA, USA, March 29 - April 1, 1995
• Syntactic control of interference revisited
• Even Simple Programs Are Hard To Analyze
• Theories of Programming Languages
• Regular-Language Semantics for a Call-by-Value Programming Language
• Payoffs, Intensionality and Abstraction in Games
• From Algol to polymorphic linear lambda-calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item