A game semantics of names and pointers

DOI10.1016/J.APAL.2007.10.006MaRDI QIDQ2474444zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 6 March 2008

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apal.2007.10.006

zbMATH Keywords

game semanticsfresh name generationpointer-based storage

Mathematics Subject Classification ID

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

Recommendations

• Foundations of Software Science and Computation Structures
• Game Semantics for Higher-Order Concurrency
• Game semantics in the nominal model
• Full abstraction for nominal general references
• A Game Semantics of Idealized CSP

Cites work

• 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 1499102 (Why is no real title available?)
• scientific article; zbMATH DE number 1405668 (Why is no real title available?)
• A Game Semantics of Idealized CSP
• A calculus for cryptographic protocols: The spi calculus
• A new approach to abstract syntax with variable binding
• A theory of bisimulation for a fragment of concurrent ML with local names
• Foundations of Software Science and Computation Structures
• Foundations of Software Science and Computational Structures
• Full abstraction for PCF
• Game Semantics for Higher-Order Concurrency
• Game-theoretic analysis of call-by-value computation
• Games and full completeness for multiplicative linear logic
• On full abstraction for PCF: I, II and III
• On the semantics of the bad-variable constructor in Algol-like languages
• Polarized games
• Premonoidal categories and notions of computation
• The regular-language semantics of second-order idealized ALGOL

Cited in

(11)

• Denotational semantics with nominal Scott domains
• Compositional Predicate Abstraction from Game Semantics
• Algorithmic games for full ground references
• Program equivalence in a simple language with state
• Sequentiality and the CPS semantics of fresh names
• An algebraic account of references in game semantics
• Game semantics in the nominal model
• Full abstraction for nominal general references
• Full Abstraction for Reduced ML
• Full abstraction for Reduced ML
• Foundations of Software Science and Computation Structures

This page was built for publication: A game semantics of names and pointers

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