On Full Abstraction for PCF: I, II, and III-Reference-Cited by-同舟云学术

On Full Abstraction for PCF: I, II, and III

Author:

Hyland J.M.E.,Ong C.-H.L.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference18 articles.

1. Fully abstract game semantics for general reference;Abramsky,1998

2. Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions;Abramsky,1997

3. Call-by-value games;Abramsky,1998

5. Abstract Böhm trees;Curien;Math. Structures Comput. Sci.,1998

Cited by 351 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Analysis of Symmetry in Quantitative Semantics;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Contextual Equivalence for State and Control via Nested Data;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

3. Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

5. The Logical Essence of Well-Bracketed Control Flow;Proceedings of the ACM on Programming Languages;2024-01-05