论文信息 - Unary PCF is Decidable

Unary PCF is Decidable

We show that unary PCF, a very small fragment of Plotkin's PCF [7], has a decidable observational pre-order, and that its fully abstract model is effectively presentable. This is in marked contrast to larger fragments, where corresponding results fail [4]. The techniques used are adaptions of those of Padovani [5], who applied them to the minimal model of the simply typed lambda calculus.

Ralph Loader

[1] Richard Statman,et al. Logical Relations and the Typed lambda-Calculus , 1985, Inf. Control..

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

[3] Manfred Schmidt-Schauß,et al. Decidability of Behavioural Equivalence in Unary PCF , 1999, Theor. Comput. Sci..

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

[5] Stefan Kahrs,et al. The Variable Containment Problem , 1995, HOA.

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

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