## Stable and Sequential Functions on Scott Domains (1992)

Citations: | 2 - 1 self |

### BibTeX

@TECHREPORT{Brookes92stableand,

author = {Stephen Brookes and Shai Geva},

title = {Stable and Sequential Functions on Scott Domains},

institution = {},

year = {1992}

}

### OpenURL

### Abstract

The search for a general semantic characterization of sequential functions is motivated by the full abstraction problem for sequential programming languages such as PCF. We present here some new developments towards such a theory of sequentiality. We give a general definition of sequential functions on Scott domains, characterized by means of a generalized form of topology, based on sequential open sets. Our notion of sequential function coincides with the Kahn-Plotkin notion of sequential function when restricted to distributive concrete domains, and considerably expands the class of domains for which sequential functions may be defined. We show that the sequential functions between two dI-domains, ordered stably, form a dI-domain. The analogous property fails for Kahn-Plotkin sequential functions. Our category of dI-domains and sequential functions is not cartesian closed, because application is not sequential. We attribute this to certain operational assumptions underlying our notio...

### Citations

398 |
LCF considered as a programming language
- Plotkin
- 1977
(Show Context)
Citation Context ...: [x; y] 2 aeg and �� 2 (ae) = fy j 9x : [x; y] 2 aeg. ffl The characterization of the finite elements of the continuous function space by means of threshold functions is well known, see for insta=-=nce [Plo77]-=-. We need the new notion of directed representations, however, in order to show preservation of (FM) by the continuous function space. Technically, the directedness of the representation will permit u... |

143 |
Type systems for programming languages
- Mitchell
- 1990
(Show Context)
Citation Context .... The failure of cartesian closure does not mean that the search for an extensional sequential semantic model is doomed; closure under function space is sufficient to provide an applicative structure =-=[Mit90]-=-, which is certainly enough to form an extensional model, and may perhaps, with further refinements, lead to a fully abstract model. The desire to (eventually) achieve full abstraction suggests that w... |

126 | Continuous lattices - Scott - 1972 |

109 |
Fully abstract models of typed lambda-calculi
- Milner
- 1977
(Show Context)
Citation Context ...ry definition of sequential functions between domains, and no known natural (i.e., language-independent) sequential extensional semantic model. The first definitions of sequentiality, given by Milner =-=[Mil77]-=- and by Vuillemin [Vui73], were limited to functions on products of flat domains. Sazonov's definition of sequential function [Saz75] is also of limited scope. Kahn and Plotkin [KP78] introduced concr... |

84 |
Sequential algorithms on concrete data structures, Theor
- Berry, Curien
- 1982
(Show Context)
Citation Context .... This serves to illustrate that concrete domains --- which are coherent, i.e., such that every pairwise consistent set has a lub --- are not closed under the stably-ordered sequential function space =-=[BC82]-=-. The reason we insist on (ff; ff; ff) being mapped to ff is so that the constant true function is removed as a potential lub. Now return to application. Let app : (Bool 3 ! Bool) \Theta Bool 3 ! Bool... |

75 | Categorical combinators, sequential algorithms, and functional programming - Curien - 1986 |

53 | Full Abstraction for sequential languages: the state of the art - Berry, Curien, et al. - 1985 |

52 |
Sequentiality and strong stability
- Bucciarelli, Ehrhard
- 1991
(Show Context)
Citation Context ...oncrete domains, and obtained a sequential intensional model from which one may recover the Kahn-Plotkin sequential functions by taking an extensional quotient. More recently, Bucciarelli and Ehrhard =-=[BE91]-=- introduced a notion of strongly stable functions between qualitative domains equipped with a coherence structure (QDC's), and obtained a definition of sequential function between QDC's that generaliz... |

38 |
Logic of Domains
- Zhang
- 1991
(Show Context)
Citation Context ...dependently of the full abstraction problem. We present here some progress towards a general theory of sequentiality, using a generalized topological approach. We first expand on recent work by Zhang =-=[Zha89]-=- and Lamarche [Lam91], and show that the stable functions are the continuous functions for a certain generalized topology, based on stable open sets, and that an appropriate order on the stable open s... |

32 | Theory and practice of sequential algorithms: the kernel of the applicative language CDS0 - Berry, Curien - 1985 |

27 |
Stable models of typed -calculi
- Berry
- 1978
(Show Context)
Citation Context ...the sequential functions between two concrete domains do not form a concrete domain (under both the pointwise and stable orders). Berry introduced dI-domains, stable functions and the stable ordering =-=[Ber78]-=-; the stable functions between two dI-domains, ordered stably, form a dI-domain. The stable functions do not provide the desired notion of sequential functions, since some stable functions are not seq... |

15 |
Proof Techniques for Recursive Programs
- Vuillemin
- 1973
(Show Context)
Citation Context ...al functions between domains, and no known natural (i.e., language-independent) sequential extensional semantic model. The first definitions of sequentiality, given by Milner [Mil77] and by Vuillemin =-=[Vui73]-=-, were limited to functions on products of flat domains. Sazonov's definition of sequential function [Saz75] is also of limited scope. Kahn and Plotkin [KP78] introduced concrete data structures and c... |

14 |
Domaines concrets
- Kahn, Plotkin
- 1978
(Show Context)
Citation Context ...given by Milner [Mil77] and by Vuillemin [Vui73], were limited to functions on products of flat domains. Sazonov's definition of sequential function [Saz75] is also of limited scope. Kahn and Plotkin =-=[KP78]-=- introduced concrete data structures and concrete domains, and gave a definition of sequential function between concrete domains. However, the sequential functions between two concrete domains do not ... |

11 | Towards a theory of parallel algorithms on concrete data structures - Brookes, Geva - 1990 |

5 |
Topology Via Logic. Number 5
- Vickers
- 1989
(Show Context)
Citation Context ...en sets are closed under arbitrary unions and finite intersections --- this may be expressed by saying that\Omega D is a sub-frame of the powerset lattice of D, ordered by inclusion (see for instance =-=[Vic89]-=-). Our generalization arises by relaxing the sub-frame requirement, and/or choosing an ordering on\Omega\Gamma/2 en sets different from set inclusion, and relaxing the (derived) requirement that the p... |

2 |
Stable domains are generalized topological spaces
- Lamarche
- 1991
(Show Context)
Citation Context ...ll abstraction problem. We present here some progress towards a general theory of sequentiality, using a generalized topological approach. We first expand on recent work by Zhang [Zha89] and Lamarche =-=[Lam91]-=-, and show that the stable functions are the continuous functions for a certain generalized topology, based on stable open sets, and that an appropriate order on the stable open sets induces the stabl... |

2 |
Sequentially and parallelly computable functionals
- Sazonov
- 1975
(Show Context)
Citation Context ...tic model. The first definitions of sequentiality, given by Milner [Mil77] and by Vuillemin [Vui73], were limited to functions on products of flat domains. Sazonov's definition of sequential function =-=[Saz75]-=- is also of limited scope. Kahn and Plotkin [KP78] introduced concrete data structures and concrete domains, and gave a definition of sequential function between concrete domains. However, the sequent... |