Loading...
Please wait, while we are loading the content...
Similar Documents
Self-Interpretation and Reflection in a Statically Typed Language (1993)
| Content Provider | CiteSeerX |
|---|---|
| Author | Läufer, Konstantin Odersky, Martin |
| Description | Introduction Reflection is the ability of a system to perform a computation about itself. This ability typically includes a way of representing programs as data ("reification") and of executing representations of programs ("self-interpretation"). The interpreter is accessible to the interpreted program in the form of an "eval" function. Reflection is traditionally studied in untyped or dynamically typed languages such as LISP [4] [2], Smalltalk [3], or the l-calculus [9]. By contrast, we consider self-interpretation and reflection in a statically typed metalanguage along the lines of [10] and [7]. Since the language is statically typed, the data structure used as a representation for programs is statically typed as well. Reflection in a statically typed context can be characterized as follows: Type-preserving representation: If a representation is well-typed, then the represented program is well-typed. Type-preservation of self-interpreta |
| File Format | |
| Language | English |
| Publisher Date | 1993-01-01 |
| Publisher Institution | In OOPSLA/ECOOP workshop on |
| Access Restriction | Open |
| Subject Keyword | Type-preserving Representation Eval Function Statically Typed Typed Context Introduction Reflection Interpreted Program Typed Language Typed Metalanguage Data Structure |
| Content Type | Text |
| Resource Type | Article |
