Towards a theory of reflective programming languages
This paper attempts to develop a better theoretical understanding of
reflective systems. We begin by a developing a reflective extension of
the λ-calculus and define a simple operational semantics for it
based on the infinite tower model described in [10]. We then develop
an equational logic from this semantics. The resulting logic is shown
to be weak because of re ective properties. We establish properties
about this logic and show that it corresponds to the operational
semantics.
© Copyright 1993 Xerox Corporation. All rights reserved.
Download paper.