Full abstraction for idealized Algol with passive expressions

DOI10.1016/S0304-3975(99)00047-XzbMath0954.68028OpenAlexW2011050558WikidataQ57006768 ScholiaQ57006768MaRDI QIDQ1575874

Guy McCusker, Samson Abramsky

Publication date: 23 August 2000

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00047-x

zbMATH Keywords

idealized Algol

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items

Automata-theoretic semantics of idealized Algol with passive expressions ⋮ Polarized games ⋮ Interpreting Localized Computational Effects Using Operators of Higher Type ⋮ Game semantics of Martin-Löf type theory ⋮ Curry-style type isomorphisms and game semantics ⋮ Block structure vs scope extrusion: between innocence and omniscience ⋮ Logic and Geometry of Agents in Agent-Based Modeling ⋮ Second-order type isomorphisms through game semantics ⋮ Regular-Language Semantics for a Call-by-Value Programming Language ⋮ A Theory for Game Theories ⋮ Syntax vs. semantics: A polarized approach ⋮ Games for complexity of second-order call-by-name programs ⋮ On full abstraction for PCF: I, II and III ⋮ Syntactic control of concurrency