The regular-language semantics of second-order idealized ALGOL

DOI10.1016/S0304-3975(03)00315-3MaRDI QIDQ1884909zbMATH OpenOpenAlexFDO

Authors Dan R. Ghica, Guy McCusker

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, https://figshare.com/articles/journal_contribution/The_Regular_Language_Semantics_of_Second-Order_Idealized_Algol/23341115

zbMATH Keywords

ALGOL-like languagesGame semanticsRegular languages

Mathematics Subject Classification ID

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

Recommendations

• Reasoning about Idealized Algol using regular languages
• Regular-language semantics for a call-by-value programming language
• scientific article; zbMATH DE number 7340142
• An approach to deciding the observational equivalence of Algol-like languages
• scientific article; zbMATH DE number 1231510

Cites work

• Even Simple Programs Are Hard To Analyze
• Extending regular expressions with iterated shuffle
• From Algol to polymorphic linear lambda-calculus
• Games and full abstraction for a functional metalanguage with recursive types
• scientific article; zbMATH DE number 3748394 (Why is no real title available?)
• scientific article; zbMATH DE number 3609632 (Why is no real title available?)
• scientific article; zbMATH DE number 1231510 (Why is no real title available?)
• scientific article; zbMATH DE number 3423547 (Why is no real title available?)
• Mathematical foundations of programming semantics. Proceedings of the 11th conference (MFPS), Tulane Univ., New Orleans, LA, USA, March 29 - April 1, 1995
• Payoffs, intensionality and abstraction in games
• Reasoning about Idealized Algol using regular languages
• Regular-language semantics for a call-by-value programming language
• Syntactic control of interference revisited
• Theories of Programming Languages

Cited in

(23)

• Verifying annotated program families using symbolic game semantics
• An approach to deciding the observational equivalence of Algol-like languages
• Weighted models for higher-order computation
• Latent semantic analysis of game models using LSTM
• A game semantics of names and pointers
• Decidability and syntactic control of interference
• Games for complexity of second-order call-by-name programs
• Reasoning about Idealized Algol using regular languages
• Definability and full abstraction
• From qualitative to quantitative semantics. By change of base
• A fragment of ML decidable by visibly pushdown automata
• Geometry of synthesis. II: From games to delay-insensitive circuits
• scientific article; zbMATH DE number 7445154 (Why is no real title available?)
• Compositional Predicate Abstraction from Game Semantics
• Program verification using symbolic game semantics
• Regular-language semantics for a call-by-value programming language
• About the undecidability of program equivalence in finitary languages with state
• On-the-Fly Techniques for Game-Based Software Model Checking
• Functions with local state: regularity and undecidability
• Disentangling parallelism and interference in game semantics
• Pushdown normal-form bisimulation: a nominal context-free approach to program equivalence
• The relational machine calculus
• A calculus of coroutines

This page was built for publication: The regular-language semantics of second-order idealized ALGOL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1884909)