Operational nominal game semantics

DOI10.1007/978-3-662-46678-0_17MaRDI QIDQ2949444zbMATH OpenOpenAlexFDO

Authors Guilhem Jaber

Publication date 1 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46678-0_17

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• Full abstraction for nominal general references
• Game semantics in the nominal model
• Trace semantics for polymorphic references
• A Fully Abstract Trace Semantics for General References
• Towards nominal Abramsky

Cited in

(9)

• Complete trace models of state and control
• Game semantics in the nominal model
• Full abstraction for nominal general references
• Towards nominal Abramsky
• Game semantics for nominal exceptions
• A Fully Abstract Trace Semantics for General References
• Disentangling parallelism and interference in game semantics
• Fully abstract normal form bisimulation for call-by-value PCF
• Pushdown normal-form bisimulation: a nominal context-free approach to program equivalence

This page was built for publication: Operational nominal game semantics

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