Author:
Abramsky Samson,McCusker Guy
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. S. Abramsky, R. Jagadeesan, and P. Malacaxia. Full abstraction for PCF. Submitted for publication, 1996.
2. S. Abramsky. Axioms for full abstraction and full completeness. In G. Plotkin and C. Sterling, editors, Milner Festschrift. MIT Press, to appear.
3. S. Abramsky and G. McCusker. Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions. In P. W. O'Hearn and R. D. Tennent, editors, Algol-like Languages, pages 297–329 of volume 2. Birkhaüser, 1997.
4. M. P. Fiore. Axiomatic Domain Theory in Categories of Partial Maps. Distinguished Dissertations in Computer Science. Cambridge University Press, 1996.
5. M. P. Fiore and G. D. Plotkin. An axiomatization of computationally adequate domain theoretic models of FPC. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 92–102. IEEE Computer Society Press, 1994.
Cited by
73 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sharing a Perspective on the -Calculus;Proceedings of the 2023 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software;2023-10-18
2. Operational Algorithmic Game Semantics;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
3. Fully Abstract Normal Form Bisimulation for Call-by-Value PCF;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
4. ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
5. Deconstructing General References via Game Semantics;Samson Abramsky on Logic and Structure in Computer Science and Beyond;2023