Relative Definability and Models of Unary PCF

Antonio Bucciarelli (1) , Benjamin Leperchey (1) , Vincent Padovani (1)

1 PPS - Preuves, Programmes et Systèmes

We show that the poset of degrees of relative definability in the Scott model of Unary PCF is non trivial, and that, nevertheless, the hierarchy of order extensional models of the language is reduced to a bottom element (the fully abstract model) and a top one (the Scott model itself).

Keywords: lambda-calcul; définissabilité; bidomaines

Domains: Programming Languages [cs.PL]; Logic in Computer Science [cs.LO]

Antonio Bucciarelli, Benjamin Leperchey, Vincent Padovani. Relative Definability and Models of Unary PCF. Jun 2003, pp.75--89. ⟨hal-00102785⟩