Contribution
Unary PCF is decidable

https://doi.org/10.1016/S0304-3975(98)00048-6Get rights and content
Under an Elsevier user license
open archive

Abstract

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.

Keywords

Lambda calculus
PCF
Decidability
Definability

Cited by (0)

1

This work was carried out while the author was at Merton College, Oxford.