Part of the Lecture Notes in Computer Science book series (LNCS, volume 217)
From interpreter to compiler: A representational derivation
KeywordsVirtual Machine Abstract Syntax Conventional Machine Denotational Semantic Machine Code
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- [Clinger 84]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.Google Scholar
- [Reynolds 72]Reynolds, J.C. “Definitional Interpreters for Higher-Order Programming Languages,” Proc. ACM Nat'l. Conf. (1972), 717–740.Google Scholar
- [McCarthy 62]McCarthy, J. “Towards a Mathematical Science of Computation,” Information Processing 62 (Popplewell, ed.) Amsterdam:North Holland, 1962, 21–28.Google Scholar
- [Wand 80]Wand, M. “Continuation-Based Program Transformation Strategies,” J. ACM 27 (1980), 164–180.Google Scholar
- [Wand 82a]Wand, M. “Semantics-Directed Machine Architecture” Conf. Rec. 9th ACM Symp. on Principles of Prog. Lang. (1982), 234–241.Google Scholar
- [Wand 82b]Wand, M. “Deriving Target Code as a Representation of Continuation Semantics” ACM Trans. on Prog. Lang. and Systems 4, 3 (July, 1982) 496–517.Google Scholar
- [Wand 83]Wand, M. “Loops in Combinator-Based Compilers,” Conf. Rec. 10th ACM Symposium on Principles of Programming Languages (1983), 190–196.Google Scholar
© Springer-Verlag Berlin Heidelberg 1986