Regular-language semantics for a call-by-value programming language

DOI10.1016/S1571-0661(04)80958-7MaRDI QIDQ4917052zbMATH OpenFDO

Authors Dan R. Ghica

Publication date 26 April 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1571-0661(04)80958-7

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Recommendations

• The regular-language semantics of second-order idealized ALGOL
• scientific article; zbMATH DE number 1670817
• About the undecidability of program equivalence in finitary languages with state
• Game semantics for call-by-value polymorphism
• scientific article; zbMATH DE number 7340142

Cites work

• Full abstraction for idealized Algol with passive expressions
• scientific article; zbMATH DE number 1670817 (Why is no real title available?)
• scientific article; zbMATH DE number 1223609 (Why is no real title available?)
• scientific article; zbMATH DE number 1231510 (Why is no real title available?)
• scientific article; zbMATH DE number 1259144 (Why is no real title available?)
• scientific article; zbMATH DE number 1342245 (Why is no real title available?)
• scientific article; zbMATH DE number 1479606 (Why is no real title available?)
• Notions of computation and monads
• On full abstraction for PCF: I, II and III

Cited in

(12)

• The regular-language semantics of second-order idealized ALGOL
• An approach to deciding the observational equivalence of Algol-like languages
• Games for complexity of second-order call-by-name programs
• Positive supercompilation for a higher-order call-by-value language
• Block structure vs scope extrusion: between innocence and omniscience
• Algorithmic nominal game semantics
• A fragment of ML decidable by visibly pushdown automata
• scientific article; zbMATH DE number 1948165 (Why is no real title available?)
• About the undecidability of program equivalence in finitary languages with state
• A Semantical and Operational Account of Call-by-Value Solvability
• Functions with local state: regularity and undecidability
• Syntactic control of concurrency

This page was built for publication: Regular-language semantics for a call-by-value programming language

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