Accession Number : ADA195928

Title :   Reification without Evaluation.

Descriptive Note : Memorandum rept.,

Corporate Author : MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB

Personal Author(s) : Bawden, Alan

PDF Url : ADA195928

Report Date : Jun 1988

Pagination or Media Count : 28

Abstract : Constructing self-referential systems, such as Brian Sm ith's 3-Lisp language, is actually more straightforward than you think. Anyone can build an infinite tower of processors (where each processor implements the processor at the next level below) by employing some common sense and one simple trick. In particular, it is not necessary to re-design quotation, take a stand on the relative merits of evaluation vs. normalization, or treat continuations as meta-level objects. This paper presents a simple programming language interpreter that illustrates how this can be done. By keeping its expression evaluator entirely separate from the mechanisms that implement its infinite tower, this interpreter avoids many troublesome aspects of previous self-referential programming languages. Given these basically straightforward techniques, processor towers might be easily constructed for a wide variety of systems to enable them to manipulate and reason about themselves. Keywords: Reification; Reflection; Introspection; Meta-representation; Continuation passing; Programming languages. (jhd)

Descriptors :   *SERIAL PROCESSORS, *COMPUTER PROGRAMMING, PROCESSING EQUIPMENT, PROGRAMMING LANGUAGES, TOWERS

Subject Categories : Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE