Brian C. Smith: Reflection and Semantics in a Procedural Language, Ph. D. thesis, MIT/LCS/TR-272, Cambridge, Massachusetts (January 1982) Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Blond Primer - Danvy, Malmkjær (1988) (Correct)
....simulator developed at DIKU, the Institute of Datalogy at the University of Copenhagen. The abstract model is described in [Danvy Malmkjr 88] and [Malmkjr 88] This report intends to be a manual. It is an informal, but self contained presentation of Blond. The basic idea of a reflective tower [Smith 82] is to have a series of interpreters interpreting each other, and connected by two meta level operations: reification and reflection [Friedman Wand 84] Each interpreter processes the one below, and the tower is run by an ultimate machine at its top. The tower is conceptually infinite. ....
Brian C. Smith: Reflection and Semantics in a Procedural Language, Ph. D. thesis, MIT/LCS/TR-272, Cambridge, Massachusetts (January 1982)
Intensions and Extensions in a Reflective Tower - Danvy, Malmkjær (1988) (28 citations) (Correct)
....reification, meta continuation, Blond, tail reflection, single threadedness, jumpy and pushy continuations # LITP Universite de Paris 6 (45 55, 2e et. 4 place Jussieu, 75252 Paris Cedex 05, FRANCE ( mcvax inria litp od) Introduction For a number of reasons reflective towers [Smith 82] Smith 84] have not led to a general understanding of what they are, nor what to do with them and only to some extent [des Rivieres Smith 84] Wand Friedman 88] how to implement them. This article attempts to contribute to the field by investigating the extensional and intensional aspects of ....
....is not a reified continuation. This corresponds to a composition of functions and can be treated properly, the idea being that as a proper tail recursion requires a constant continuation, a proper tail reflection requires a constant meta continuation. 3 Comparison with related work 3. 1 3 Lisp [Smith 82] introduces the model of the reflective tower together with an implementation: 3 Lisp. It addresses a number of the central issues about reflection such as its philosophical background, the limits of machine representation, the semantic framework, the finite implementation of the infinite tower, ....
Brian C. Smith: Reflection and Semantics in a Procedural Language, Ph. D. thesis, MIT/- LCS/TR-272, Cambridge, Massachusetts (January 1982)
Abstracting Control - Danvy, Filinski (1990) (48 citations) (Correct)
....combinators, respectively. It also stresses the duality between sharing data structures and sharing control when constructing these data structures. 2 Abstracting control and evaluating a term in a series of embedded contexts can be related to computational reflection and the reflective tower [Smith 82] Leaving aside the fact that a reflective tower addresses all the elements of the computational field and not only control, our contexts correspond to the levels in the reflective tower. In particular, the 2 For example, listing the suffixes of a list encourages sharing the tails of the ....
Brian C. Smith: Reflection and Semantics in a Procedural Language, PhD thesis, MIT/LCS/TR-272, MIT, Cambridge, Massachusetts (January 1982)
A Case-Based Answer to Some Problems of Knowledge-Based Systems - Aamodt (1993) (Correct)
No context found.
Smith-82 Brian C. Smith: Reflections and semantics in a procedural language. MIT Technical Report, LCR-TR-272, 1972.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC