An axiomatic account of a fully abstract game semantics for general references

DOI10.1007/978-3-031-24117-8_7MaRDI QIDQ6612783

Guy McCusker, Jim Laird

Publication date: 1 October 2024

zbMATH Keywords

full abstractiongame semanticscomputational effectshigher-order storesemantics of programming languagescomputational adequacy

Mathematics Subject Classification ID

Quantum computation (81P68) Logic in computer science (03B70) Theory of computing (68Qxx)

Cites Work

• Imperative programs as proofs via game semantics
• Resource modalities in tensor logic
• LCF considered as a programming language
• On full abstraction for PCF: I, II and III
• Relational properties of domains
• From global to local state, coalgebraically and compositionally
• A Categorical Semantics of Higher Order Store
• Full abstraction for nominal general references
• Game theoretic analysis of call-by-value computation
• A categorical model of an \textbf{i/o}-typed \(\pi \)-calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An axiomatic account of a fully abstract game semantics for general references