Reification: Reflection without Metaphysics

, and . Proceedings of the 1984 ACM Symposium on LISP and functional programming, page 348--355. New York, NY, USA, ACM, (1984)


<par>We consider how the data structures of an interpreter may be made available to the program it is running, and how the program may alter its interpreter's structures. We refer to these processes as <italic>reification</italic> and <italic>reflection</italic>. We show how these processes may be considered as an extension of the fexpr concept in which not only the form and the environment, but also the continuation, are made available to the body of the procedure. We show how such a construct can be used to effectively add an unlimited variety of &ldquo;special forms&rdquo; to a very small base language. We consider some trade-offs in how interpreter objects are reified. Our version of this construct is similar to one in 3-Lisp Smith 82, 84, but is independent of the rest of 3-Lisp. In particular, it does not rely on the notion of a tower of interpreters.</par>



Links and resources

BibTeX key:
search on:

Comments and Reviews  

There is no review or comment yet. You can write one!


Cite this publication