## Observable Sequentiality and Full Abstraction (1992)

### Cached

### Download Links

- [www.ccs.neu.edu]
- [www.cs.rice.edu]
- [www.ccs.neu.edu]
- [www.cs.rice.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proceedings of POPL ’92 |

Citations: | 39 - 5 self |

### BibTeX

@INPROCEEDINGS{Cartwright92observablesequentiality,

author = {Robert Cartwright and Matthias Felleisen},

title = {Observable Sequentiality and Full Abstraction},

booktitle = {In Proceedings of POPL ’92},

year = {1992},

pages = {328--342},

publisher = {ACM Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

ion Robert Cartwright Matthias Felleisen Department of Computer Science Rice University Houston, TX 77251-1892 Abstract One of the major challenges in denotational semantics is the construction of fully abstract models for sequential programming languages. For the past fifteen years, research on this problem has focused on developing models for PCF, an idealized functional programming language based on the typed lambda calculus. Unlike most practical languages, PCF has no facilities for observing and exploiting the evaluation order of arguments in procedures. Since we believe that such facilities are crucial for understanding the nature of sequential computation, this paper focuses on a sequential extension of PCF (called SPCF) that includes two classes of control operators: error generators and escape handlers. These new control operators enable us to construct a fully abstract model for SPCF that interprets higher types as sets of error-sensitive functions instead of continuous...

### Citations

395 | LCF considered as a programming language - Plotkin - 1977 |

261 | Domains for denotational semantics - Scott - 1982 |

257 | R.: The revised report on the syntactic theories of sequential control and - Felleisen, Hieb - 1992 |

201 |
The Lambda Calculus. Its Syntax and Semantics" (revised edition
- Barendregt
- 1984
(Show Context)
Citation Context ...ly(apply(S; x); y); z) = (S) apply(apply(x; z); apply(y; z)) Proof. By induction on n for each approximation Kn and Sn . This implies that the fi axiom for bracket abstractions is valid in this model =-=[1]-=-. Corollary 4.8 ((fi)) For combinator terms M , M 0 , ( x:M )M 0 = M [x /M 0 ]. To determine the important equations for catch and error values, we draw on our operational intuition about capturing th... |

194 | Lectures on a mathematical theory of computations - Scott - 1981 |

148 | The theory and practice of first-class prompts - Felleisen - 1988 |

116 | A syntactic theory of sequential control - Felleisen, Friedman, et al. - 1987 |

98 | Towards fully abstract semantics for local variables: Preliminary report - Meyer, Sieber - 1988 |

84 |
Sequential algorithms on concrete data structures, Theor
- Berry, Curien
- 1982
(Show Context)
Citation Context ...er 's nor Plotkin's result showed how to construct fully abstract denotational models for sequential languages. In a later effort to understand the semantics of sequential languages, Berry and Curien =-=[2, 3, 5, 8]-=- constructed models for PCF with more restrictive domains of procedure denotations. Berry eliminated many parallel functions from the domain of procedure denotations by forcing functions to be stable.... |

66 | C*: An extended C language for data parallel programming - Rose, Steele - 1987 |

53 |
Full Abstraction for sequential languages: the state of the art
- Berry, Curien, et al.
- 1985
(Show Context)
Citation Context ...er 's nor Plotkin's result showed how to construct fully abstract denotational models for sequential languages. In a later effort to understand the semantics of sequential languages, Berry and Curien =-=[2, 3, 5, 8]-=- constructed models for PCF with more restrictive domains of procedure denotations. Berry eliminated many parallel functions from the domain of procedure denotations by forcing functions to be stable.... |

46 | Fully Abstract Models of Typed -calculi - Milner - 1977 |

41 |
Modèles complètement adéquats et stables des lambda-calculs typés, Thèse de doctorat d’état, Université Paris VII
- Berry
- 1979
(Show Context)
Citation Context ...er 's nor Plotkin's result showed how to construct fully abstract denotational models for sequential languages. In a later effort to understand the semantics of sequential languages, Berry and Curien =-=[2, 3, 5, 8]-=- constructed models for PCF with more restrictive domains of procedure denotations. Berry eliminated many parallel functions from the domain of procedure denotations by forcing functions to be stable.... |

32 |
Theory and practice of sequential algorithms: the kernel of the applicative language CDS0
- Berry, Curien
- 1985
(Show Context)
Citation Context ...ns to be stable. This construction eliminated some of the spurious distinctions between phrases in the conventional model, but it introduced some new ones. 2 To address this problem, Berry and Curien =-=[3, 4]-=- imposed further restrictions on the space of procedure denotations by interpreting procedures as sequential algorithms over concrete domains [12]. A sequential algorithm is a function plus a strategy... |

32 | Reasoning with continuations II: Full abstraction for models of control - Sitaram, Felleisen - 1990 |

29 | Fully Abstract Models of Programming Languages - Stoughton - 1988 |

27 | Full Abstraction and Semantic Equivalence - Mulmuley - 1987 |

20 | Full Abstraction and the Context Lemma - Jim, Meyer |

15 | Proof Techniques for Recursive Programs - Vuillemin - 1973 |

9 | S'equentialit'e de l'evaluation formelle des -expressions - Berry - 1978 |

7 | Common Lisp---The Language - Steele - 1984 |

6 |
The topology of program termination
- Cartwright, Demers
- 1988
(Show Context)
Citation Context ... the procedural constants and the combinators associated with SPCF, and prove the basic equational properties of the tree model. 4.1 Domains A Scott domain is the ideal completion of a finitary basis =-=[6, 18, 19]-=-. A finitary basis B is a countable, partially ordered set such that every finite, bounded subset has a least upper bound; the principal ideals corresponding to elements of B are the finite elements o... |

2 | The revised report on Scheme, a dialect of Lisp. Memo 452, MIT AI-Lab - Sussman - 1978 |

1 | Structures des donn'es concr`etes (Domaines Concr`etes - Kahn, Plotkin - 1978 |