Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Objects, interference, and the Yoneda embedding
O’Hearn P. (ed), Reddy U. Theoretical Computer Science228 (1-2):253-282,1999.Type:Article
Date Reviewed: Apr 1 2000

Algol-like languages, languages of great theoretical and practical importance, are studied in this paper. Following the stance that procedures act on the state that exists at their point of declaration, and that a variable (associated with an active integer) can be modeled as a side-effect and a value, effectively allowing value-returning commands, the authors address the concepts of locality and state-change irreversibility, history being implicit within a state, so that earlier states cannot be retrieved.

The constructions follow from the object-based approach of Reddy and the categorical approach of Reynolds, and involve a great deal of category theory. Beginning with coherent spaces (sequences of operations on which a consistency relation is defined), Algol commands are modeled as regular maps. These preserve (in-)consistency and are “history free.” Declaring a new variable causes the current store shape to be enlarged, giving a new shape (a “product”) on which subsequent commands act. Using a standard construction due to Yoneda, products are preserved under embedding, and this ultimately leads to an implementation of sharing that allows interference via the determinate use of interfering objects in a shared evaluation context. This is well described as “active sequentiality.”

Throughout, the authors provide a helpful dialogue, explaining their motivations and aspirations, as well as their reservations. The paper concludes with a full abstraction result that further strengthens the “decoupling” of the meaning of a procedure from its “internal data.” Apart from the references mentioned in the paper, similar, related material can be found in O’Hearn and Reynolds [1].

Reviewer:  D. J. Cooke Review #: CR122637
1) O’Hearn, P. W. and Reynolds, J. C. From Algol to polymorphic linear lambda calculus. J. ACM 47, 1 (Jan. 2000), 167–223.
Bookmark and Share
 
Denotational Semantics (F.3.2 ... )
 
 
Language Constructs and Features (D.3.3 )
 
Would you recommend this review?
yes
no
Other reviews under "Denotational Semantics": Date
Category-sorted algebra-based action semantics
Even S., Schmidt D. (ed) Theoretical Computer Science 77(1-2): 73-95, 1990. Type: Article
Nov 1 1991
Domains for logic programming
Filippenko I., Morris F. Theoretical Computer Science 94(1): 63-99, 1992. Type: Article
Apr 1 1993
On the fixpoints of nondeterministic recursive definitions
Chen T. Journal of Computer and System Sciences 29(1): 58-79, 1984. Type: Article
May 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy