Polymorphic rewriting conserves algebraic confluence
Information and Computation
Kripke logical relations and PCF
Information and Computation
Theoretical Computer Science
Extensions to Type Systems Can Preserve Operational Equivalences
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Decidability of All Minimal Models
TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
Word Problem for Thue Systems with a Few Relations
Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
Studying the Fully Abstract Model of PCF within its Continuous Function Model
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Relative definability of boolean functions via hypergraphs
Theoretical Computer Science
About the undecidability of program equivalence in finitary languages with state
ACM Transactions on Computational Logic (TOCL)
On sequential functionals of type 3
Mathematical Structures in Computer Science
On λ-Definability I: the Fixed Model Problem and Generalizations of the Matching Problem
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Definability and Full Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
Decidability and syntactic control of interference
Theoretical Computer Science
Operational domain theory and topology of sequential programming languages
Information and Computation
Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity
Electronic Notes in Theoretical Computer Science (ENTCS)
Relative definability and models of unary PCF
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Universality results for models in locally boolean domains
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Higher-order program verification and language-based security
ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
A self-dependency constraint in the simply typed lambda calculus
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Program equivalence in a simple language with state
Computer Languages, Systems and Structures
On λ-Definability I: the Fixed Model Problem and Generalizations of the Matching Problem
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Model Checking Higher-Order Programs
Journal of the ACM (JACM)
An observationally complete program logic for imperative higher-order functions
Theoretical Computer Science
| Hi-index | 5.23 |
The question of the decidability of the observational ordering of finitary PCF was raised (Jung and Stoughton, in: M. Bezem, J.F. Groote (Eds.), Typed Lambda Calculi and Applications, Lecture Notes in Computer Science, vol. 664, Springer, Berlin, 1993, pp. 230-244) to give mathematical content to the full abstraction problem for PCF (Milner, Theoret. Comput. Sci. 4 (1977) 1-22). We show that the ordering is in fact undecidable. This result places limits on how explicit a representation of the fully abstract model can be. It also gives a slight strengthening of the author's earlier result on typed ability (Loader, in: A. Anderson, M. Zeleny (Eds.), Church Memorial Volume, Kluwer Academic Press, Dordrecht, to appear). Copyright 2001 Elsevier Science B.V.