The theory of fexprs is trivial

Higher-Order and Symbolic Computation

Volumn 10, Issue 3, 1998, Pages 189-199

  Wand, Mitchell ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Contextual equivalence; Fexprs; Reflection

Indexed keywords

EID: 54649083485     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. Abadi, Martin and Cardelli, Luca. A theory of primitive objects: Untyped and first-order systems. Information and Computation, 125(2):78-102, March 1996.
2. Curry, Haskell B., Feys, R., and Seldin, J.P. Combinatory Logic, volume 2. North-Holland, 1972.
3. Danvy, Olivier and Malmkjær, Karoline. Intensions and extensions in a reflective tower. In Proc. 1988 ACM Symposium on Lisp and Functional Programming, pages 327-341, 1988.
4. Jefferson, Stanley and Friedman, Daniel P. A simple reflective interpreter. Lisp and Symbolic Computation, 9(2/3): 181-202, May/June 1996.
5. Malenfant, Jacques, Dony, Christophe and Cointe, Pierre. A semantics of introspection in a reflective prototype-based language. Lisp and Symbolic Computation, 9(2/3): 153-180, May/June 1996.
6. McCarthy, John, et al. LISP 1.5 Programmer's Manual. MIT Press, Cambridge, MA, 1965.
7. Mendhekar, Anurag. Theoretical Aspects of Reflection in Programming Languages. PhD thesis, Indiana University, Bloomington, IN, 1998. to appear.
8. Meyer, Albert R.. Thirteen puzzles in programming logic. In D. BjØrner, editor, Proceedings of the Workshop on Formal Software Development: Combining Specification Methods, Lecture Notes in Computer Science, Berlin, Heidelberg, and New York, May 1984. Springer-Verlag.
9. Mogensen, Torben Æ. Efficient self-interpretation in lambda calculus. Journal of Functional Programming, 2(3):345-364, July 1992.
10. Morris, Jr., James H. Lambda Calculus Models of Programming Languages. PhD thesis, MIT, Cambridge, MA, 1968.
11. Muchnick, Steven and Pleban, Uwe. A semantic comparison of LISP and SCHEME. In Conference Record of the 1980 LISP Conference, 1980.
12. Muller, Robert. M-LISP: A representation-independent dialect of LISP with reduction semantics. ACM Transactions on Programming Languages and Systems, 14(4):589-616, October 1992.
13. Plotkin, Gordon D. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science, 1:125-159, 1975.
14. Plotkin, Gordon D. LCF considered as a programming language. Theoretical Computer Science, 5:223-255, 1977.
15. Smith, Brian C. Reflection and semantics in Lisp. In Conf. Rec. llth ACM Symposium on Principles of Programming Languages, pages 23-35, 1984.
16. Wadsworth, Christopher P. Some unusual A-calculus numeral systems. In J. P. Hindley and J. R. Seidin, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, pages 215-230. Academic Press, New York and London, 1980.
17. Wand, Mitchell. Specifying the correctness of binding-time analysis. Journal of Functional Programming, 3(3):365-387, July 1993.
18. preliminary version appeared in Conf. Rec. 20th ACM Symp. on Principles of Prog. Lang. (1993), 137-143.
19. Wand, Mitchell and Friedman, Daniel P. The mystery of the tower revealed: A non-reflective description of the reflective tower. Lisp and Symbolic Computation, 1:11-37, 1988.
20. Reprinted in Meta-Level Architectures and Reflection (P. Maes and D. Nardi, eds.) North-Holland, Amsterdam, 1988, pp. 111-134.