From standard to non-standard semantics by semantics modifiers

International Journal of Foundations of Computer Science

Volumn 12, Issue 2, 2001, Pages 171-211

  Abramov, Sergei ^a   Glück, Robert ^b  

^a PROGRAM SYSTEMS INSTITUTE   (Russian Federation)

^b WASEDA UNIVERSITY   (Japan)

Author keywords

interpreters; non standard semantics; partial evaluation; program transformation; programming languages; supercompilation

Indexed keywords

EID: 0008746433     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054101000448     Document Type: Article

References (56)

1. S. M. Abramov, "Metavychislenija i logicheskoe programmirovanie (Metacomputation and logic programming)," Programmirovanie 3 (1991) 31-44 in Russian.
2. S. M. Abramov, "Metacomputation and program testing," in 1st International Workshop on Automated and Algorithmic Debugging, Linkoping University, Sweden, 1993, pp. 121-135.
3. S. M. Abramov, Metavychislenija i ikh prilozhenija (Metacomputation and its applications) (Nauka-Fizmatlit, Moscow, 1995) in Russian.
4. S. M. Abramov and R. Gliick, "Semantics modifiers: an approach to non-standard semantics of programming languages," in Third Fuji International Symposium on Functional and Logic Programming, eds. M. Sato and Y. Toyama (World Scientific, 1998) pp. 247-270.
5. S. M. Abramov and R. Gliick, "The universal resolving algorithm: inverse computation in a functional language," in Mathematics of Program Construction, Proceedings, eds. R. Backhouse and J. Oliveira, LNCS (Springer-Verlag, 2000) to appear.
6. K. Apt and F. Turini, Meta-Logics and Logic Programming (MIT Press, Cambridge, Massachusetts, 1995).
7. K. Asai, S. Matsuoka and A. Yonezawa, "Duplication and partial evaluation-for a better understanding of reflective languages," Lisp and Symbolic Computation 9(2&3) (1996) 203-241.
8. R. Bird, Programs and Machines (John Wiley & Sons, London, 1976).
9. D. Bj0rner, A. P. Ershov and N. D. Jones, eds., Partial Evaluation and Mixed Computation, (North-Holland, Amsterdam, 1988).
10. A. Bondorf and J. Palsberg, "Generating action compilers by partial evaluation," Journal of Functional Programming 6(2) (1996) 269-298.
11. A. F. Bowers and C. A. Gurr, "Towards fast and declarative meta-programming," in [6], pp. 137-166.
12. C. Consel, "New insights into partial evaluation: the Schism experiment," in ESOP'88, ed. H. Ganzinger, LNCS 300 (Springer-Verlag, 1988) 236-247.
13. C. Consel and R. Marlet, "Architecture software using: a methodology for language development," in Principles of Declarative Programming. Proceedings, eds. C. Palamidessi, H. Glaser and K. Meinke, LNCS 1490 (Springer-Verlag, 1998) 170-194.
14. O. Danvy, "Across the bridge between reflection and partial evaluation," in [9], pp. 83-116.
15. O. Danvy, R. Gliick and P. Thiemann, eds., Partial Evaluation. Proceedings, LNCS 724 (Springer-Verlag, 1996).
16. J. Darlington, "An experimental program transformation and synthesis system," Artificial Intelligence 16(1) (1981) 1-46.
17. N. Dershowitz and J.-P. Jouannaud, "Rewrite systems," in Handbook of Theoretical Computer Science, ed. J. v. Leeuwen (Elsevier, 1990) pp. 244-320.
18. J. Earley and H. Sturgis, "A formalism for translator interactions," Communications of the ACM 13(10) (1970) 607-617.
19. A. P. Ershov, "On the essence of compilation," in Formal Description of Programming Concepts, ed. E. Neuhold (North-Holland, Amsterdam, 1978), pp. 391-420.
20. Y. Putamura, "Partial evaluation of computing process-an approach to a compilercompiler," Systems, Computers, Controls 2(5) (1971) 45-50.
21. Y. Futamura, K. Nogi and A. Takano, "Essence of generalized partial computation," Theoretical Computer Science 90(1) (1991) 61-79.
22. R. Gliick, "On the generation of specializes," Journal of Functional Programming 4(4) (1994) 499-514.
23. R. Gliick and J. J0rgensen, "Generating optimizing specializes," in IEEE International Conference on Computer Languages (IEEE Computer Society Press, 1994) pp. 183-194.
24. R. Gliick and J. J0rgensen, "Generating transformers for deforestation and supercompilation," in Static Analysis. Proceedings, ed. B. Le Charlier, LNCS 864 (Springer-Verlag, 1994) 432-448.
25. R. Gliick and J. J0rgensen, "An automatic program generator for multi-level specialization," Lisp and Symbolic Computation 10(2) (1997) 113-158.
26. R. Gliick and A. V. Klimov, "Occam's razor in metacomputation: the notion of a perfect process tree," in Static Analysis. Proceedings, eds. P. Cousot, M. Falaschi, G. File and A. Rauzy, LNCS 724 (Springer-Verlag, 1993) 112-123.
27. D. Gries, The Science of Programming, Texts and Monographs in Computer Science (Springer-Verlag, New York, 1981).
28. P. G. Harrison, "Function inversion," in [9], pp. 153-166.
29. J. Hatcliff and R. Gliick, "Reasoning about hierarchies of online specialization systems," in [15], pp. 161-182.
30. P. Hudak, et al., "Report on the programming language Haskell, a non-strict purely functional language," SIGPLAN Notices 27(5) (1992) R1-R164.
31. N. D. Jones, C. K. Gomard and P. Sestoft, Partial Evaluation and Automatic Program Generation (Prentice-Hall, 1993).
32. N. D. Jones, P. Sestoft and H. S0ndergaard, "An experiment in partial evaluation: the generation of a compiler generator," in Rewriting Techniques and Applications, ed. J.-P. Jouannaud, LNCS 202 (Springer-Verlag, 1985) 124-140.
33. N. D. Jones, P. Sestoft and H. S0ndergaard, "Mix: a self-applicable partial evaluator for experiments in compiler generation," LISP and Symbolic Computation 2(1) (1989) 9-50.
34. J. J0rgensen, "Generating a compiler for a lazy language by partial evaluation," in Nineteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (1992) pp. 258-268.
35. A. Kishon and P. Hudak, "Semantics directed program execution monitoring," Journal of Functional Programming 5(4) (1995) 501-547.
36. R. Kowalski, "Algorithm = logic + control," Communications of the ACM 22(7) (1979) 424-436.
37. M. Leuschel, "On the power of homeomorphic embedding for online termination," in Static Analysis. Proceedings, ed. G. Levi, LNCS 1503 (Springer-Verlag, 1998) 230-245.
38. J. McCarthy, P. W. Abrahams, D. J. Edwards, T. P. Hart and M. I. Levin, Lisp 1.5 Programmer's Manual (MIT Press, Cambridge, Massachusetts, 1962) 2nd edition (1965).
39. T. M. Mogensen, "Partially static structures in a self-applicable partial evaluator," in [9], pp. 325-347.
40. A. P. Nemytykh and V. A. Pinchuk, "Program transformation with metasystem transitions: experiments with a supercompiler," in Perspectives of System Informatics. Proceedings, eds. D. Bj0rner, M. Broy and I. V. Pottosin, LNCS 1181 (Springer-Verlag, 1996) 249-260.
41. A. Y. Romanenko, "The generation of inverse functions in Refal," In [9], pp. 427-444.
42. A. Y. Romanenko, "Inversion and metacomputation," in Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation (ACM Press, 1991) pp. 12-22.
43. B. J. Ross, "Running programs backwards: the logical inversion of imperative computation," Formal Aspects of Computing 9 (1997) 331-348.
44. P. Sestoft, "The structure of a self-applicable partial evaluator," Technical Report 85/11, DIKU, University of Copenhagen, Denmark, Nov. 1985.
45. M. H. S0rensen, R. Gliick and N. D. Jones, "A positive supercompiler," Journal of Functional Programming 6(6) (1996) 811-838.
46. M. Sperber, R. Gliick and P. Thiemann, "Bootstrapping higher-order program transformers from interpreters," in Proceedings of the 1996 ACM Symposium on Applied Computing, eds. K. M. George, J. H. Carroll, D. Oppenheim and J. Hightower (ACM Press, 1996) pp. 408-413.
47. L. Sterling and E. Shapiro, The Art of Prolog (MIT Press, Cambridge, Massachusetts, 1986).
48. A. Takeuchi, "Affinity between meta interpreters and partial evaluation," in Information Processing 86, ed. H.-J. Kugler (Elsevier Science Publishers, 1986) pp. 279-282.
49. P. Thiemann and M. Sperber, "Polyvariant expansion and compiler generators," in Perspectives of System Informatics. Proceedings, eds. D. Bj0rner, M. Broy and I. V. Pottosin, LNCS 1181 (Springer-Verlag, 1996) 285-296.
50. V. F. Turchin, "Ehkvivalentnye preobrazovanija rekursivnykh funkcij na Refale (Equivalent transformations of recursive functions defined in Refal)," in Teorija Jazykov i Metody Programmirovanija (Proceedings of the Symposium on the Theory of Languages and Programming Methods), Kiev-Alushta, USSR, 1972, pp. 31-42, in Russian.
51. V. F. Turchin, "The concept of a supercompiler," Transactions on Programming Languages and Systems 8(3) (1986) 292-325.
52. V. F. Turchin, "The algorithm of generalization in the supercompiler," in [9], pp. 531-549.
53. V. F. Turchin, "Program transformation with metasystem transitions," Journal of Functional Programming 3(3) (1993) 283-313.
54. J. L. A. van de Snepscheut, What computing is all about (Springer-Verlag, 1993).
55. W. Vanhoof and B. Martens, "To parse or not to parse," in Logic Program Synthesis and Transformation., ed. N. Fuchs, LNCS 1463 (Springer-Verlag, 1998) 314-333.
56. M. Wand and D. P. Friedman, "The mystery of the tower revealed: a nonreflective description of the reflective tower," Lisp and Symbolic Computation 1(1) (1988) 11-37.