A. J. Demers and J. E. Donahue. Making variables abstract: An equational theory for Russell. In Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, pages 59--72. ACM Press, January 1983. Also published as Technical Report 82-534, Department of Computer Science, Cornell University. (p. 124)  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... semantics of call by value control operators with respect to CPS semantics; his proof technique is different from ours but the resulting set of axioms is the same (modulo some syntactic differences) The axiomatization of the semantics of languages with assignments has been studied extensively [8, 17, 23, 26, 29, 51, 61, 102]. Each of the previously proposed logics was designed independently, and differs from the others in subtle ways. Our approach of deriving the calculus from the store passing axioms is more systematic and generalizes to other languages [88] Also, when compared to other systems, our calculus has ....

Demers, A. and Donahue, J. Making variables abstract: An equational theory for Russell. In Conference Record of the 10th ACM Symposium on Principles of Programming Languages (1983) 59--72.

....operations [4, ch. 5] The Strong Normalization and Postponement results cannot carry over to languages with higher typed or untyped references. As a consequence, these results do not hold for the calculi of several programming languages that mix functional and imperative features, i.e. Russell [3], Scheme (Lisp) 2, 7, 8, 11, 12] and ML [22] A recently discovered alternative to mixing functional and fully imperative languages is the addition of a weakened form of assignment to functional languages [9, 15] None of these languages or calculi is comparable to IA with respect to ....

Alan Demers and James Donahue. Making variables abstract: an equational theory for Russell. In Proceedings of the ACM Symposium on Principles of Programming Languages, pages 59#72, 1983.

.... the semantics of call by value control operators with respect to CPS semantics; his proof technique is different from ours but the resulting set of axioms is the same (modulo some syntactic differences) The axiomatization of the semantics of languages with assignments has been studied extensively [8, 17, 23, 26, 29, 51, 61, 102]. Each of the previously proposed logics was designed independently, and differs from the others in subtle ways. Our approach of deriving the calculus from the store passing axioms is more systematic and generalizes to other languages [88] Also, when compared to other systems, our calculus has ....

Demers, A. and Donahue, J. Making variables abstract: An equational theory for Russell. In Conference Record of the 10th ACM Symposium on Principles of Programming Languages (1983) 59--72.

....modification in order to extend the methods of Abramsky and Howe to the computational language presented in this paper. We plan to investigate this approach. An early effort in the direction of equational theories for proving correctness of higherorder imperative programs is Demers and Donahue [5]. They present an equational proof system for deriving assertions about programs in the language Russell, an extension of the higher order typed lambda calculus with cells and destructive cell operations. Their work is motivated by a desire to clarify the meaning of program constructs via an ....

A. Demers and J. Donahue. Making variables abstract: An equational theory for Russell. In 10th ACM Symposium on Principles of Programming Languages, pages 59--72, 1983.

....intersection types. The Strong Normalization and Postponement results cannot carry over to languages with highertyped or untyped references. As a consequence, these results do not hold for the calculi of several programming languages that mix functional and imperative features, i.e. Russel [4], Scheme (Lisp) 2, 8, 9, 12, 13] and ML [22] A recently discovered alternative to mixing functional and fully imperative languages is the addition of a weakened form of assignment to functional languages [10, 16] None of these languages or calculi is comparable to IA with respect to ....

Demers, A. and J. Donahue. Making variables abstract: an equational theory for Russell. In Proc. 10th ACM Symposium on Principles of Programming Languages , 1983, 59--72.

....equivalence in one fragment coincides with equivalence in the other. Theorem (Fragments) e 0 =fo e 1 , e 0 =zo e 1 m m e 0 fo e 1 , e 0 zo e 1 An early effort in the direction of equational theories for proving correctness of higher order imperative programs is Demers and Donahue [6]. They present an equational proof system for deriving assertions about programs in the language Russell, an extension of the higher order typed lambda calculus with cells and destructive cell operations. Their work is motivated by a desire to clarify the meaning of program constructs via an ....

A. Demers and J. Donahue. Making variables abstract: An equational theory for Russell. In 10th ACM Symposium on Principles of Programming Languages, 1983.

....4 Related Work Our equational systems were motivated by the work of Plotkin [20] who studied equational reasoning systems for call by name and call by value in functional languages, and Felleisen et al. [9, 10] who developed calculi for call by value imperative languages. Demers and Donahue [5] give an equational logic for reasoning about a higher order language that uses call by value parameter passing and has memory objects similar to reference cells. The equational theory contains several dozen axioms for which they present no formal results. Mason and Talcott [16] present a ....

Demers, A. and J. Donahue. Making variables abstract: an equational theory for Russell. In Proc. 10th ACM Symposium on Principles of Programming Languages, 1983, 59--72.

....intersection types. The Strong Normalization and Postponement results cannot carry over to languages with higher typed or untyped references. As a consequence, these results do not hold for the calculi of several programming languages that mix functional and imperative features, i.e. Russel [4], Scheme (Lisp) 2, 8, 9, 12, 13] and ML [22] A recently discovered alternative to mixing functional and fully imperative languages is the addition of a weakened form of assignment to functional languages [10, 16] None of these languages or calculi is comparable to IA with respect to ....

Demers, A. and J. Donahue. Making variables abstract: an equational theory for Russell. In Proc. 10th ACM Symposium on Principles of Programming Languages , 1983, 59--72.

....the questions of how their theories relate to the underlying theory of procedural abstraction and of how the various theories relate to each other. An early effort in the direction of equational theories for proving the correctness of higher order imperative programs is due to Demers and Donahue [4]. The focus of their research is Russell, an extension of the higher order typed calculus with cells and destructive cell operations; their major result is a proof system for Russell with several dozen axioms, quite unlike our reductions or the Mason Talcott axioms. Besides equational assertions, ....

Demers, A. and J. Donahue. Making variables abstract: an equational theory for Russell. In Proc. 10th ACM Symposium on Principles of Programming Languages , 1983, 59--72.

.... such a store and its related operations can yield a natural store algebra that can be used for optimization purposes [9] Since it is often the case that one wishes to reason about languages directly rather than by translation, there have been many proposals for logics for imperative languages [2, 4, 6, 7, 8, 10, 11, 17]. Although each of these was designed independently, and differs from the others in subtle ways, the similarities between them suggest the existence of a systematic way to derive equational logics from the semantics of the languages. We propose to construct logics for imperative languages by ....

Demers, A. and Donahue, J. Making variables abstract: An equational theory for Russell. In Conference Record of the 10th ACM Symposium on Principles of Programming Languages (1983) 59--72.

No context found.

A. J. Demers and J. E. Donahue. Making variables abstract: An equational theory for Russell. In Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, pages 59--72. ACM Press, January 1983. Also published as Technical Report 82-534, Department of Computer Science, Cornell University. (p. 124)

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