Author of the publication

Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantics, Natural Semantics, and Abstract Machines.

. Semantics and Algebraic Specification, volume 5700 of Lecture Notes in Computer Science, page 162-185. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Eta-expansion does The Trick, , and . ACM Trans. Program. Lang. Syst., 18 (6): 730--751 (1996)On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion, and . Inf. Process. Lett., 106 (3): 100-109 (2008)The Essence of Eta-Expansion in Partial Evaluation., , and . PEPM, page 11-20. University of Melbourne, Australia, Department of Computer Science, (1994)Three Syntactic Theories for Combinatory Graph Reduction., and . LOPSTR, volume 6564 of Lecture Notes in Computer Science, page 1-20. Springer, (2010)J Is for JavaScript: A Direct-Style Correspondence between Algol-Like Languages and JavaScript Using First-Class Continuations., , and . DSL, volume 5658 of Lecture Notes in Computer Science, page 1-19. Springer, (2009)Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part I: Denotational Semantics, Natural Semantics, and Abstract Machines.. Semantics and Algebraic Specification, volume 5700 of Lecture Notes in Computer Science, page 162-185. Springer, (2009)Defunctionalization at Work., and . PPDP, page 162-174. ACM, (2001)A Generic Account of Continuation-Passing Styles., and . POPL, page 458-471. ACM Press, (1994)Syntactic Theories in Practice., and . RULE@PLI, volume 59 of Electronic Notes in Theoretical Computer Science, page 358-374. Elsevier, (2001)The Tortoise and the Hare Algorithm for Finite Lists, Compositionally.. ACM Trans. Program. Lang. Syst., 45 (1): 1:1-1:35 (March 2023)