Preview
Unable to display preview. Download preview PDF.
References
Clinger, W. “The Scheme 311 Compiler: An Exercise in Denotational Semantics,” Conf. Rec. 1984 ACM Symposium on Lisp and Functional Programming (August, 1984), 356–364.
Reynolds, J.C. “Definitional Interpreters for Higher-Order Programming Languages,” Proc. ACM Nat'l. Conf. (1972), 717–740.
McCarthy, J. “Towards a Mathematical Science of Computation,” Information Processing 62 (Popplewell, ed.) Amsterdam:North Holland, 1962, 21–28.
Wand, M. “Continuation-Based Program Transformation Strategies,” J. ACM 27 (1980), 164–180.
Wand, M. “Semantics-Directed Machine Architecture” Conf. Rec. 9th ACM Symp. on Principles of Prog. Lang. (1982), 234–241.
Wand, M. “Deriving Target Code as a Representation of Continuation Semantics” ACM Trans. on Prog. Lang. and Systems 4, 3 (July, 1982) 496–517.
Wand, M. “Loops in Combinator-Based Compilers,” Conf. Rec. 10th ACM Symposium on Principles of Programming Languages (1983), 190–196.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wand, M. (1986). From interpreter to compiler: A representational derivation. In: Ganzinger, H., Jones, N.D. (eds) Programs as Data Objects. Lecture Notes in Computer Science, vol 217. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16446-4_17
Download citation
DOI: https://doi.org/10.1007/3-540-16446-4_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16446-3
Online ISBN: 978-3-540-39786-1
eBook Packages: Springer Book Archive