论文信息 - Finitary PCF is not decidable

Finitary PCF is not decidable

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.

Ralph Loader

[1] Alley Stoughton,et al. Studying the Fully Abstract Model of PCF within its Continuous Function Model , 1993, TLCA.

[2] G.D. Plotkin,et al. LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[3] Yuri V. Matiyasevich. Word Problem for Thue Systems with a Few Relations , 1993, Term Rewriting.

[4] Radha Jagadeesan,et al. Full Abstraction for PCF , 1994, Inf. Comput..

[5] Robin Milner,et al. Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..

[6] K. Sieber. Applications of Categories in Computer Science: Reasoning about sequential functions via logical relations , 1992 .

[7] Ralph Loader. Unary PCF is Decidable , 1998, Theor. Comput. Sci..

[8] Vincent Padovani,et al. Decidability of All Minimal Models , 1995, TYPES.

[9] Peter W. O'Hearn,et al. Kripke Logical Relations and PCF , 1995, Inf. Comput..

[10] Val Tannen,et al. Polymorphic Rewriting Conserves Algebraic Confluence , 1994, Inf. Comput..

[11] Jon G. Riecke,et al. Extensions to Type Systems Can Preserve Operational Equivalences , 1994, TACS.

[12] Samson Abramsky,et al. Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions , 1996, Electron. Notes Theor. Comput. Sci..