On Berry's conjectures about the stable order in PCF
PCF is a sequential simply typed lambda calculus language. There is a unique order-extensional fully abstract cpo model of PCF, built up from equivalence classes of terms. In 1979, G\'erard Berry defined the stable order in this model and proved that the extensional and the stable order togethe...
Main Author: | Fritz Müller |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2012-10-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/925/pdf |
Similar Items
-
Game semantics for first-order logic
by: Olivier Laurent
Published: (2010-10-01) -
Labelled transition systems as a Stone space
by: Michael Huth
Published: (2005-01-01) -
Conway games, algebraically and coalgebraically
by: Furio Honsell, et al.
Published: (2011-09-01) -
Coalgebraic trace semantics via forgetful logics
by: Bartek Klin, et al.
Published: (2017-04-01) -
Undecidability of Equality in the Free Locally Cartesian Closed Category (Extended version)
by: Simon Castellan, et al.
Published: (2017-11-01)