Peter van den Bosch
- A. V. Aho and J. D. Ullman,
Principles of compiler design , Addison-Wesley, 1977]] Google Scholar
Digital Library
- P. J. Brown, The ML/I macro processor,
Communications of the ACM 10 (1967), pp 618--623]] Google ScholarDigital Library - R. M. Burstall and J. Darlington, A transformation system for developing recursive programs,
Journal of the ACM 24 (1977), pp 44--67]] Google ScholarDigital Library - J. Feldman and D. Gries, Translator writing systems: An exploration of concepts and principles,
Communications of the ACM 11 (1968), pp 77--113]] Google ScholarDigital Library - R. W. Floyd, On the nonexistence of a phrase structure grammar for Algol 60,
Communications of the ACM 5 (1962), pp 483--484]] Google ScholarDigital Library - S. L. Graham, Table-driven code generation,
IEEE Computer , 13 8 (August 1980), pp 25--34]]Google ScholarDigital Library - W. J. Hansen,
Creation of hierarchic text with a computer display , PhD Thesis, Stanford University, 1971]] Google ScholarDigital Library - S. C. Johnson, YACC: Yet another compiler-compiler, Computing Science Technical Report #32, Bell Laboratories Murray Hill, NJ, 1978]]Google Scholar
- B. W. Kernighan, RATFOR -- A preprocessor for a rational FORTRAN,
Software --Practice and Experience 5 (1975), pp 395--406]]Google Scholar - D. E. Knuth, Structured programming with
goto statements,Computing Surveys 6 (1974), pp 261--301]] Google ScholarDigital Library - B. M. Leavenworth, Syntax macros and extended translation,
Communications of the ACM 9 (1966), pp 790--793]] Google ScholarDigital Library - B. W. Leverett, R. G. Cattell, S. O. Hobbs, J. M. Newcomer, A. H. Reiner, B. R. Schatz, and W. A. Wulf, An overview of the Production Quality Compiler-compiler project, Technical report CMU-CS-79-105, Department of Computer Science, Carnegie-Mellon University, 1979]]Google Scholar
- W. M. McKeeman, Peephole optimization,
Communications of the ACM 8 (1965), pp 443--445]] Google ScholarDigital Library - M. Marcotty, H. F. Ledgard, and G. V. Bochman, A sampler of formal definitions,
Computing Surveys 8 (1976), pp 191--276]] Google ScholarDigital Library - C. N. Mooers, TRAC, A procedure-describing language for the reactive typewriter,
Communications of the ACM 9 (1966), pp 215--219]] Google ScholarDigital Library - C. Strachey, A general purpose macrogenerator,
The Computer Journal 8 (1965), pp 225--241]]Google ScholarCross Ref
- T. Teitelbaum and T. Reps, The Cornell program synthesizer: A syntax directed programming environment, Technical report, Cornell University, May 1980]] Google ScholarDigital Library
- D. A. Turner, A new implementation technique for applicative languages,
Software --Practice and Experience 9 (1979), pp 31--49]]Google Scholar - P. N. van den Bosch, The translation of programming languages through the use of a graph transformation language, PhD Thesis, Department of Computer Science, The University of British Columbia, Vancouver, February 1981]]Google Scholar
- P. Wegner, The Vienna Definition Language,
Computing Surveys 4 (1972), pp 5--63]] Google ScholarDigital Library - W. A. Wulf, R. L. London, and M. Shaw, An introduction to the construction and verification of ALPHARD programs,
IEEE Transactions on Software Engineering 2 (1976), pp 253--265]]Google ScholarDigital Library
Index Terms
- The translation of programming languages through the use of a graph transformation language
Index terms have been assigned to the content through auto-classification.
Recommendations
Designing language-oriented programming languages
OOPSLA '10: Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companionToday, language-oriented programming (LOP) is realized by using either language workbenches or internal DSLs, each with their own advantages and disadvantages. In this work, we design a host language for DSLs with language workbench features, thereby ...
Definitional Interpreters for Higher-Order Programming Languages
Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language ...
Comments