G. R'ev'esv. Rule-based semantics for an extended lambda-calculus. In M. Main, A. Melton, M. Mislove, and D. Schmidt, editors, Mathematical Foundations of Programming Language Semantics, pages 43--56. Lecture Notes in Computer Science vol. 298, Springer, April 1987.  Home/Search   Document Not in Database   Summary   Related Articles

....these equations, the third and sixth especially emphasize the isomorphisms D = D D and D = D Theta D. There are models where D D is represented by a closure on D (as is D Theta D) but where this is not an isomorphism. It follows that the special equations are independent of the others. In [R 87] the question is brought up whether we can add to the above equations one relating functional abstraction with pairing. In particular, the following would be interesting: pair(x) y) z: pair(x(z) y(z) This equation identifies the primitive pairing with what could be called pointwise ....

G. R'ev'esv. Rule-based semantics for an extended lambda-calculus. In M. Main, A. Melton, M. Mislove, and D. Schmidt, editors, Mathematical Foundations of Programming Language Semantics, pages 43--56. Lecture Notes in Computer Science vol. 298, Springer, April 1987.

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