Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

TCS
1998

favoriteEmaildiscussreport

113views Theoretical Computer Science» more TCS 1998»

Unary PCF is Decidable

13 years 4 months ago

Unary PCF is Decidable

Download homepages.ihug.co.nz

We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is eﬀectively 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

Real-time Traffic

Cidable Observational Pre-order | Simply Typed Lambda Calculus | TCS 1998 | Theoretical Computer Science | Unary Pcf |

claim paper

Related Content

» Decidable Theories of the Ordering of Natural Numbers with Unary Predicates

» Decidable Extensions of Churchs Problem

» Modal logic of time division

» Deciding expressive description logics in the framework of resolution

» There is no ordering on the classes in the generalized highlow hierarchies

» Deciding Full Branching Time Logic by Program Transformation

» On decidability of monadic logic of order over the naturals extended by monadic predicates

» On the Complexity of Verifying Consistency of XML Specifications

» The firstorder theory of subtyping constraints

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	TCS
Authors	Ralph Loader

Comments (0)