Recommendations
Cites work
- A calculus for cryptographic protocols: The spi calculus
- A Game Semantics of Idealized CSP
- 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
- 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?)
- 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)- Algorithmic games for full ground references
- 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
- Compositional Predicate Abstraction from Game Semantics
- Full abstraction for Reduced ML
- Program equivalence in a simple language with state
- Sequentiality and the CPS semantics of fresh names
- Foundations of Software Science and Computation Structures
- Denotational semantics with nominal Scott domains
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)
