Static and dynamic semantics processing

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 1991, Pages 14-24

  Consel, Charles ^a   Danvy, Olivier ^b  

^a YALE UNIVERSITY   (United States)

^b KANSAS STATE UNIVERSITY   (United States)

Author keywords

Algol; Binding times; Compiler generation; Partial evaluation; SCHEME; Self Application; Semantics

Indexed keywords

ALGOL (PROGRAMMING LANGUAGE); APPLICATION PROGRAMS; MAPPING; PETROLEUM RESERVOIR EVALUATION; PROGRAM INTERPRETERS; SEMANTICS; SYNTACTICS;

ALGOL; BINDING TIMES; COMPILER GENERATION; PARTIAL EVALUATION; SCHEME;

PROGRAM COMPILERS;

EID: 85010915450     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/99583.99588     Document Type: Conference Paper

References (40)

1. D. Bjoner, A. P. Ershov, and N. D. Jones, editors. Partial Evaluation and Mixed Computation. North-Holland, 1988.
2. A. Bondorf. Automatic autoprojection of higher order recursive equations. In N. D. Jones, editor, ESOP 90, d European Symposium on Programming, volume 432 of Lecture Notes in Computer Science, pages 70-87. Springer-Verlag, 1990.
3. A. Bondorf and O. Danvy. Automatic autoprojection of recursive equations with global variables and abstract data types. Diku Research Report 90/04, University of Copenhagen, Copenhagen, Denmark, 1990. To appear in Science of Computer Programming.
4. A. Bondorf, N. D. Jones, T. Mogensen, and P. Sestoft. Binding time analysis and the taming of selfappl. ication. Diku report, University of Copenhagen, Copenhagen, Denmark, 1988.
5. C. Consel. New insights into partial evaluation: The Schism experiment. In H. Ganzinger, editor, ESOP 88, 2nd European Symposium on Programming, volume 300 of Lecture Notes in Computer Science, pages 236-246. Springer-Verlag, 1988.
6. C. Consel. Analyse de Programmed, Evaluation Partielle et Generation de Compiiateur9. PhD thesis, Universitc de Paris VI, Paris, France, 1989.
7. C. Consel. Binding time analysis for higher order untyped functional languages. In ACM Conference on Lisp and Functional Programming, pages 264-272, 1990.
8. C. Consel. The Schism Manual. Yale University, New Haven, Connecticut, USA, 1990. Version 1.0.
9. C. Consel and O. Danvy. From interpreting to compiling binding times. In N. D. Jones, editor, ESOP 90,.5" European Symposium on Programming, volume 432 of Lecture Notes in Computer Science, pages 88-105. Springer-Verlag, 1990.
10. C. Consel and S. C. Khoo. Semantics-directed generation of a Prolog compiler. Research Report 781, Yale University, New Haven, Connecticut, USA, 1990.
11. O. Danvy. Semantics-directed compilation of non-linear patterns. Technical Report 303, Indiana University, Bloomington, Indiana, USA, 1990.
12. A. P. Ershov, D. Bjorner, Y. Futamura, K. Furukawa, A. Haraldsson, and W. L. Scherlis, editors. Seiected Papers from the Workshop on Partial Evaluation and Mixed Computation, volume 6 of 2, 3. OHMSHA. LTD. and Springer-Verlag, 1988.
13. Y. Futamura. Partial evaluation of computation process-An approach to a compiler-compiler. So ems, Computers, Controls 2, 5, pages 45-50, 1971.
14. H. Ganzinger and N. D. Jones, editors. Programs as Data Objects, volume 217 of Lecture Notes in Computer Science. Springer-Verlag, 1985.
15. N. D. Jones. Challenging problems in partial evaluation and mixed computation. In [12], pages 1-14.
16. N. D. Jones, editor. Semantics-Directed Compiler Generation, volume 94 of Lecture Notes in Computer Science. Springer-Verlag, 1980.
17. N. D. Jones, C. K. Gomard, A. Bondorf, O. Danvy, and T. Mogensen. A self-Applicable partial evaluator for the lambda calculus. In IEEE International Conference on Computer Languages, pages 49-58, 1990.
18. N. D. Jones and S. S. Muchnick. Some thoughts towards the design of an ideal language. In ACM Conference on Principles of Programming Languages, pages 77-94, 1976.
19. N. D. Jones, P. Sestoft, and H. Sondergaard. An experiment in partial evaluation: The generation of a compiler generator. In J.-P. Jouannaud, editor, Rewriting Techniques and Applications, Dijon, France, VOL ume 202 of Lecture Notes in Computer Science, pages 124-140. Springer-Verlag, 1985.
20. N. D. Jones, P. Sestoft, and H. Sondergaard. Mix: A self-Applicable partial evaluator for experiments in compiler generation. LISP and Symbolic Computation n, 2(1):9-50, 1989.
21. R. Kesley and P. Hudak. Realistic compilation by program transformation. In ACM Symposium on Principles of Programming Languages, pages 281-292, 1989.
22. D. A. Kranz, R. Kesley, J. A. Rees, P. Hudak, J. Philbin, and N. I. Adams. OrbIt: An optimizing compiler for Scheme. SIGPLA N Notices, ACM Symposium on Compiler Construction, 21(7):219-233, 1986.
23. P. Lee. Realistic Compiler Generation. MIT Press, 1989.
24. M. Montenyohl and M. Wand. Correct flow analysis in continuation semantics. In ACM Symposium on Principles of Programming Languages, pages 204-218, 1988.
25. F. L. Morris. The next 700 formal language descriptions. Unpublished paper, 1970.
26. P. Mosses. S1S-Semantics Implementation System, reference manual and user guide. University of Aarhus, Aarhus, Denmark, 1979. Version 1.0.
27. H. R. Nielson and F. Nielson. Automatic binding time analysis for a typed A-calculus. In ACM Symposium on Principles of Programming Languages, pages 98-106, 1988.
28. H. R. Nielson and F, Nielson, The TM L-Approach to compiler-compilers. Technical Report 88-47, TechnicaJ University of Denmark, Lyngby, Denmark, 1988.
29. L. Paulson. A semantics-directed compiler generator. In ACM Symposium on Principles of Programming Languages, pages 224-233, 1982.
30. U. Pleban. Semantics-directed compiler generation. In ACM Symposium on Principles of Programming Languages, 1987. TutoriaJ.
31. J. Rees and W. Clinger. Revised3 report on the algorithmic language Scheme. SIGPLAN Notices, 21(12):37-79, 1986.
32. J. Reynolds. Definitional interpreters for higher order programming languages. In ACM National Conference, pages 717-740, 1971
33. J. Reynolds. The essence of Algol. In Van Vliet, editor, International Symposium on Algorithmic Languages, pages 345-372. North-Holland, 1981.
34. D. A. Schmidt. Detecting global variables in denot ational specification. ACM Transactions on Prograrnrning Languages and Systems, 7(2):299-310, 1985.
35. D. A. Schmidt. Denotational Semontics: A Methodology for Language Development. Allyn and Bacon, Inc., 1986.
36. P. Sestoft. The structure of a self-Applicable partial evaluator. In [14], pages 236-256.
37. J. Stoy. Denotationcd Semantics: The Scott-Strachey approach to programming languages theory. MIT Press, 1977.
38. M. Wand. Deriving target code as a representation of continuation semantics. ACM Transactions on Programming Languages and Systems, 4(3):496-517, 1982.
39. M. Wand. A semantic protot yping system. SIGPLA N Notices, ACM Symposium on Compiler Construction, 19(6):213-221, 1984.
40. M. Wand and Z. Wang. Conditional lambda-Theories and the verification of static properties of programs. In IEEE Symposium on Logic in Computer Science, pages 321-332, 1990.