Combining semantics with non-standard interpreter hierarchies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1974, Issue , 2000, Pages 201-213

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

^a RUSSIAN ACADEMY OF SCIENCES   (Russian Federation)

^b WASEDA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

MATHEMATICAL THEORY;

PROGRAM INTERPRETERS;

EID: 84947704458     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44450-5_16     Document Type: Conference Paper

References (20)

1. S. M. Abramov, R. Glück. From standard to non-standard semantics by semantics modifiers. International Journal of Foundations of Computer Science. to appear.
2. S. M. Abramov, R. Glück. The universal resolving algorithm: inverse computation in a functional language. In R. Backhouse, J. N. Oliveira (eds.), Mathematics of Program Construction. Proceedings, LNCS 1837, 187–212. Springer-Verlag, 2000.
3. K. Apt, F. Turini. Meta-Logics and Logic Programming. MIT Press, 1995.
4. O. Danvy. Across the bridge between reflection and partial evaluation. In D. Bjørner, A. P. Ershov, N. D. Jones (eds.), PEMC, 83–116. North-Holland, 1988.
5. O. Danvy, R. Glück, P. Thiemann (eds.). Partial Evaluation. Proceedings, LNCS 1110. Springer-Verlag, 1996.
6. J. Earley, H. Sturgis. A formalism for translator interactions. CACM, 13(10):607–617, 1970.
7. Y. Futamura. Partial evaluation of computing process – an approach to a compilercompiler. Systems, Computers, Controls, 2(5):45–50, 1971.
8. S. Jefferson, D. P. Friedman. A simple reflective interpreter. Lisp and Symbolic Computation, 9(2/3):181–202, 1996.
9. N. D. Jones, C. K. Gomard, P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.
10. S. N. Kamin. Programming Languages: An Interpreter-Based Approach. Addison-Wesley, 1990.
11. A. Kishon, P. Hudak. Semantics directed program execution monitoring. Journal of Functional Programming, 5(4):501–547, 1995.
12. P. Lucas, P. Lauer, H. Stigleitner. Method and notation for the formal definition of programming languages. Technical report, IBM Lab Vienna, 1968.
13. J. McCarthy. Recursive functions of symb. expressions. CACM, 3(4):184–195, 1960.
14. F. G. Pagan. On interpreter-oriented definitions of programming languages. Computer Journal, 19(2):151–155, 1976.
15. J. C. Reynolds. Definitional interpreters for higher-order programming languages. In ACM Annual Conference, 717–740. ACM, 1972.
16. B. J. Ross. Running programs backwards: the logical inversion of imperative computation. Formal Aspects of Computing, 9:331–348, 1997.
17. B. C. Smith. Reflection and semantics in Lisp. In POPL, 23–35. ACM Press, 1984.
18. G. L. Steele. Building interpreters by composing monads. In POPL, 472–492. ACM Press, 1994.
19. G. L. Steele, G. J. Sussman. The art of the interpreter or, the modularity complex (parts zero, one, two). MIT AI Memo 453, MIT AI Laboratory, 1978.
20. L. Sterling, E. Shapiro. The Art of Prolog. MIT Press, 1986.