Stephen Weeks and Matthias Felleisen. On the orthogonality of assignments and procedures in Algol. In Proc. 20 th Annual ACM Symposium on Principles of Programming Languages, pages 57--70, 1993. 14 A List of the remaining auxiliary functions  Home/Search   Document Details and Download   Summary   Related Articles   Check

....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 above mentioned finest possible relation structure for the construction of a fully abstract model. This is the reason why our techniques do not straightforwardly carry over to these alternative languages. ....

Stephen Weeks and Matthias Felleisen. On the orthogonality of assignments and procedures in Algol. In Proc. 20 th Annual ACM Symposium on Principles of Programming Languages, pages 57--70, 1993. 14 A List of the remaining auxiliary functions

....but because they are allowed to be passed as arguments, it is not possible to statically detect assignments of locals to variables. 5 computation mechanism in the sense that recursion is a separate construct and calls of procedure constants can be eliminated by the copy rule (Theorem 8. 6, cf. [WF93]) Record extension is interpreted very simply: Record types give positive information, in that values of type record(F : T ) are records with field F and possibly other fields. This interpretation underlies more sophisticated systems for subtyping, just as structural equivalence underlies name ....

Stephen Weeks and Matthias Felleisen. On the orthogonality of assignments and procedures in Algol. In Proceedings, Twentieth POPL, 1993.

....are presented in Table 1. An auxiliary transition relation Gamma. between closed Alg terms is defined in Table 2. We explicitly distinguish between and Gamma. in order to emphasize that the operational semantics of an Algol like language is naturally separated into two layers [30, 8, 9, 38]: Gamma. describes the purely functional layer, in which the only transition steps are fi reduction and recursion unfolding. describes the imperative layer, where transition steps can depend on the store and or change the store. The only connection between the two layers is given by the ....

....and recursion unfolding. describes the imperative layer, where transition steps can depend on the store and or change the store. The only connection between the two layers is given by the (interaction) rule of Table 2. In the (context) rule we make use of so called evaluation contexts [38]. In our setting, an evaluation context E is a particular configuration with at least one hole defined by E : succ[ fi fi pred [ fi fi (asgn l [ ms) fi fi (cond [ MN; ms) fi fi seq [ M fi fi dealloc l [ fi fi pcond [ fi fi pcond [ n; ms) fi fi ....

[Article contains additional citation context not shown here]

Stephen Weeks and Matthias Felleisen. On the orthogonality of assignments and procedures in Algol. In Proc. 20 th Annual ACM Symposium on Principles of Programming Languages, pages 57--70, Charleston, 1993.

.... of Felleisen (1987) that was published in (Felleisen and Hieb 1992) Other successful uses of the technique include: the type soundness proof, via subject reduction, for the imperative ML type system (Felleisen and Wright 1991) the analysis of parameter passing in Algol (Crank and Felleisen 1991; Weeks and Felleisen 1993); and the analysis of reduction calculi for Scheme like languages (Sabry and Felleisen 1993; Fields and Sabry 1993) Much work has been done to develop methods for reasoning about operational approximation and equivalence: Abramsky (1990, 1991) Bloom (1990) Egidi, Honsell, and Ronchi della Rocca ....

Weeks, S. and M. Felleisen (1993). On the orthogonality of assignments and procedures in Algol. In Proceedings 20th ACM Symposium on Principles of Programming Languages, pp. 57--70.

....for modeling wide spectrum languages that build on a functional core. 1 Introduction Recent years have given us a good deal of theoretical research on the interaction of imperative programming (exemplified by variable assignment) and functional programming (exemplified by higher order functions) [3, 6, 19, 21, 24]. The common method of all these works is to propose a calculus extended with imperative features and to carry out an exploration of the operational semantics of the new calculus. Based on our own experience in devising such an extended calculus [13] the present work singles out the name, ....

S. Weeks and M. Felleisen. On the orthogonality of assignments and procedures in Algol. In Proc. 20th ACM Symposium on Principles of Programming Languages, pages 57--70. ACM Press, January 1993.

.... 1989) that was later published in (Felleisen and Hieb, 1992) Other notable successful uses of the technique is the type soundness proof, via subject reduction, of the imperative ML type system (Felleisen and Wright, 1991) The analysis of parameter passing in Algol (Crank and Felleisen, 1991; Weeks and Felleisen, 1993). The analysis of reduction calculi for Scheme like languages (Sabry and Felleisen, 1993; Fields and Sabry, 1993) In 1987 Ian Mason realized that it provided the ideal notion of a normal form and symbolic evaluation needed in the completeness result presented in (Mason and Talcott, 1992a) The ....

Weeks, S. and Felleisen, M. (1993). On the orthogonality of assignments and procedures in Algol. In Proceedings 20th ACM Symposium on Principles of Programming Languages, pages 57--70.

....provide a natural style of compilation of a program. The idea is simple but important, because virtually all compilers exploit it: the binding of an identifier, i, to an expression, e 2 Value, can be performed at compile time. Indeed, this activity might be considered the essence of compiling [118, 143]. Here is an initial, significant example: regardless of a language s binding strategy, a collection of declarations of parameterized subroutines can be processed at compile time because they form a record of abstractions, which must be a value, by Definition 10. For example, regardless of ....

Weeks, S., and Felleisen, M. On the orthogonality of assignments and procedures in Algol. In Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages (Charleston, South Carolina, Jan. 1993), pp. 20--35.

....provide a natural style of compilation of a program. The idea is simple but important, because virtually all compilers exploit it: the binding of an identifier, i, to an expression, e 2 Value, can be performed at compile time. Indeed, this activity might be considered the essence of compiling [20, 27]. Here is an initial, significant example: regardless of a language s binding strategy, a collection of declarations of parameterized subroutines can be processed at compile time because they form a record of abstractions, which must be a value, by Definition 3. For example, regardless of binding ....

Stephen Weeks and Matthias Felleisen. On the orthogonality of assignments and procedures in algol. In Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages, pages 20--35, Charleston, South Carolina, January 1993.

....proceeds as follows: in a first phase, perform all fi steps producing an imperative program, and in a second phase performs all the imperative operations. The only catch is that the imperative program resulting from an Idealized Algol program may be infinite, so this view is only conceptual (Weeks Felleisen, 1993). In practice the two evaluators would be implemented as coroutines. It is interesting to note that O Hearn (1995) shows that the observational equivalence of the full Idealized Algol language conservatively extends the observational equivalence of the functional sublanguage, which might be ....

Weeks, Stephen, & Felleisen, Matthias. (1993). On the orthogonality of assignments and procedures in Algol. Pages 57--70 of: ACM Symposium on Principles of Programming Languages.

....fails in a 7 th example. Aknowledging the depth of the problem, Mason and Talcott even proposed an Operational Framework [MT92b, MT92a] to solve it out of denotational semantics. Apart from this problem, there is interesting remark about the Orthogonality of assignments and procedures in Algol [WF93] A theorem is enunciated, proving that normalization of an Algol program can be done in two phase, one using fi and copy rules, and the other a simple stack machine. We do not obtain such a result, since we do not explicitly distinguish between imperative and functional features in the ....

S. Weeks and M. Felleisen. On the orthogonality of assignments and procedures in Algol. In Proc. ACM Symposium on Principles of Programming Languages, pp. 61--78, January 1993.

No context found.

S. Weeks and M. Felleisen. On the orthogonality of assignments and procedures in Algol. In POPL [POP93], pages 57--70. Also in [OT97a], pages 101--124. Biographical Data Name: Stephen Cooper Date and Place of Birth: September 11, 1966 Washington, D. C. Elementary & High School: Charles E. Smith Jewish Day School,

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