| Gateley, J. and Duba, B.F. Call-by-value combinatory logic and the lambdavalue calculus. In Brookes, S., editor, Proceedings of the Conference on the Mathematical Foundations of Programing Semantics, Lecture Notes in Computer Science, 517, Springer Verlag (1991). |
....(x: x) M N) j v ) if false M N) Int f ) N (If f ) 87 To avoid the consistency problem, we restrict the equational theory for the source language by eliminating j v . In the next section, we will add a sound and restricted version of j v that applies only to functional constants [45]. 4.3.1 The CPS Language: cps(CS ) Given our extensions to the source language, the CPS language cannot be a subset of unless the CPS transformation encodes all new constructs in the source language using procedures. Since such an encoding is not a proper CPS transformation, the CPS language ....
Gateley, J. and Duba, B.F. Call-by-value combinatory logic and the lambdavalue calculus. In Brookes, S., editor, Proceedings of the Conference on the Mathematical Foundations of Programing Semantics, Lecture Notes in Computer Science, 517, Springer Verlag (1991).
....d 0 e x) M N) j v ) if false M N) Int f ) N (If f ) 87 To avoid the consistency problem, we restrict the equational theory for the source language by eliminating j v . In the next section, we will add a sound and restricted version of j v that applies only to functional constants [45]. 4.3.1 The CPS Language: cps(CS ) Given our extensions to the source language, the CPS language cannot be a subset of unless the CPS transformation encodes all new constructs in the source language using procedures. Since such an encoding is not a proper CPS transformation, the CPS language must ....
Gateley, J. and Duba, B.F. Call-by-value combinatory logic and the lambdavalue calculus. In Brookes, S., editor, Proceedings of the Conference on the Mathematical Foundations of Programing Semantics, Lecture Notes in Computer Science, 517, Springer Verlag (1991).
.... a set of axioms, A, that extends the call by value calculus such that: v A M = N iff fij cps(M) cps(N) Such a correspondence theorem would be similar to the correspondence theorems for the calculus and combinatory logic [2: ch 7] and the v calculus and by value combinatory logic [13]. In analogy to model theory, we call the left to right direction soundness and the right to left direction completeness since the CPS transformation is often taken as the definition of a call by value semantics. To derive A, we proceed in three steps: 1. First, we develop a CPS transformation ....
Gateley, J. and B.F. Duba. Call-by-value combinatory logic and the lambdavalue calculus. In Proc. 1991 Workshop on Mathematical Foundations of Programming Semantics. Lecture Notes in Computer Science 517, to appear.
.... a set of axioms, A, that extend the call by value calculus such that: v A M = N iff fij cps(M ) cps(N ) Such a correspondence theorem would be similar to the correspondence theorems for the calculus and combinatory logic [2: ch 7] and the v calculus and by value combinatory logic [11]. In analogy to model theory, we call the left to right direction soundness and the right to left direction completeness since the CPS transformation is often taken as the definition of a callby value semantics. To derive A, we proceed in three steps: 1. First, we develop a CPS transformation ....
Gateley, J. and B.F. Duba. Call-by-value combinatory logic and the lambda-value calculus. In Proc. 1991 Workshop on Mathematical Foundations of Programming Semantics. Lecture Notes in Computer Science 517, to appear.
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