Sciweavers

Share
TCS
1998

Unary PCF is Decidable

8 years 7 months ago
Unary PCF is Decidable
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in marked contrast to larger fragments, where corresponding results fail [?]. The techniques used are adaptions of those of Padovani [?], who applied them to the minimal model of the simply typed lambda calculus.
Ralph Loader
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 1998
Where TCS
Authors Ralph Loader
Comments (0)
books