K. Sieber. New steps towards full abstraction for local variables. In SIPL '93 [34], pages 88--100.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....a set of states; the other is the lower level location oriented approach. The former presents a generalized, object oriented view of variables, while the latter considers variables simply as generalized addressable memory locations. Interestingly enough, the location oriented possible world models [60, 61] seem to be no less powerful in validating program equivalences and enjoy theoretical properties at least as good as the higher level models. The two alternative views of state raise significant issues of language design, programming style and theoretical detail, but it is unclear whether they ....

K. Sieber. New steps towards full abstraction for local variables. In SIPL [62], pages 88--100.

....In the third part, I define a notion of program equivalence induced by the translation into FORUM, and prove that it coincides with the standard definition of program equivalence. Furthermore, using FORUM specifications I prove several of the program equivalences involving mutable store in [MS88, Sie93, SF92, OT93]. In the fourth part, I specify the sequential and pipelined operational semantics for DLX. I also prove that the sequential and pipelined operational semantics are equivalent. Furthermore, I formulate a notion of program equivalence for DLX programs, and prove correctness of code rescheduling ....

....to change pieces of existing programs as better algorithms and implementations are developed. Observational equivalence provides a framework to verify whether two programs can be exchanged. The study of observational equivalence for functional languages with state has been particularly difficult [MS88, OT93, SF92, MT92, Sie93, OT92]. In specifying vs , I have placed the evaluator for vs within the rich proof theory of FORUM. I use the meta theory of FORUM to analyze observational equivalence. I first define observational equivalence for vs programs with respect to the natural semantics and the specification in FORUM, E vs ....

Kurt Sieber. New steps towards full abstraction for local variables. In Proc. ACM SIGPLAN Workshop on State in Programming Languages (Technical Report YALEU/DCS/RR-968, Yale University), pages 88--100, Copenhagen, Denmark, 1993.

....others are also interested in questions of behavioral properties of programs. For example, full abstraction is such a question. Recent work on full abstraction has focused on the semantics of blocks and local variables. The work of O Hearn and Tennent [47] 48] 65] and the work of Sieber [62] [63] [61] use logical relations (i.e. higher order extensions of the kind of simulation relations we study in the next section) to obtain a restricted domain of procedure denotations. The idea is to restrict the domain of procedure denotations so that a procedure can only affect certain variables, ....

Kurt Sieber. New steps towards full abstraction for local variables. In Proc. ACM SIGPLAN Workshop on State in Programming Languages, pages 88--100, Copenhagen, Denmark, 1993. Published as Yale University, Dept. of Comp. Sci. Technical Report YALEU/DCS/RR-968.

....can be safely allocated on a stack. Such carefully drawn constraints also make it possible to consider construction of a denotational semantics for state in Idealized Algol. One line of models for Algol like state has been developed by Halpern, Meyer, Trakhtenbrot and Sieber [HMT84, MS88, Sie93, Sie94] These build on the very simple model described above, but take into account the support of procedures: the locations they actually use and how they affect them. This is done through a system of multiple simultaneous logical relations, indexed in the style of Kripke models. In [MS88] ....

K. Sieber. New steps towards full abstraction for local variables. In Proceedings of the 1993 ACM SIGPLAN Workshop on State in Programming Languages, number YALEU/DCS/RR-968 in Yale University, Department of Computer Science, Research Report, pages 88--100, 1993.

....a : A(R) ffl Morphisms. A morphism f : A B is a continuous function f : jAj jBj satisfying the Uniformity Condition: For all R, f : A(R) B(R) Composition and identities are inherited from CPO. SR is related to the categories defined for giving models of languages with local variables (Sieber, 1993; O Hearn and Tennent, 1993) Notice that SR does not consist of arbitrary continuous functions, certain of which are singled out using relations; rather, we use a parametricity condition to constrain hom sets from the very beginning. The model is therefore not a collapse of the full continuous ....

Sieber, K. (1993). New steps towards full abstraction for local variables. In ACM SIGLPLAN Workshop on State in Programming Languages, pages 88--100. Available as Yale Technical Report YALEU/DCS/RR-968.

....it distinguishes our approach from the one in [OT93a, OT93b] which is tailored to an Algol like 1 In the remainder of the Introduction we tacitly assume that we are not speaking about the full language but only about the second order subset. 2 This first step has already been presented in [Sie93]. 1 language with snap back effect and parallel conditional [OT] The snap back effect plays a more important role than the parallel conditional. If function procedures have either permanent side effects [WF93] or no side effects at all [Len93] then it seems more difficult to determine the ....

Kurt Sieber. New steps towards full abstraction for local variables. In Proc. ACM SIGPLAN Workshop on State in Programming Languages (Technical Report YALEU/DCS/RR-968, Yale University), pages 88-- 100, Copenhagen, Denmark, 1993.

....(logical) relations come again into play. The idea to use relations for constructing models of Algol like languages originates with [13] but the particular model which was presented there, failed to be fully abstract because the set of relations was too small. The idea was resumed in [23] and [33] with larger sets of relations, thus leading to improved models in which all the known test equivalences [13, 8, 23] for Algol like languages could be validated, but a full abstraction proof for these models was still missing. Here we will present such a proof for (a slight variant of) the model ....

....with larger sets of relations, thus leading to improved models in which all the known test equivalences [13, 8, 23] for Algol like languages could be validated, but a full abstraction proof for these models was still missing. Here we will present such a proof for (a slight variant of) the model in [33]. It should be mentioned that our motivation for using logical relations is somewhat different from O Hearn and Tennent s motivation in [23] Their intention was to transfer Reynolds concept of relational parametricity [11] from polymorphic languages to Algol like languages, because they see a ....

Kurt Sieber. New steps towards full abstraction for local variables. In Proc. ACM SIGPLAN Workshop on State in Programming Languages (available as Technical Report YALEU/DCS/RR-968, Yale University), pages 88--100, Copenhagen, Denmark, 1993.

No context found.

K. Sieber. New steps towards full abstraction for local variables. In SIPL '93 [34], pages 88--100.

No context found.

K. Sieber. New steps towards full abstraction for local variables. In SIPL '93 [118], pages 88--100. (pp. 93, 125)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC