DSpace Repository

Reification without Evaluation

Show simple item record

dc.creator Bawden, Alan
dc.date 2004-10-04T14:57:10Z
dc.date 2004-10-04T14:57:10Z
dc.date 1988-06-01
dc.date.accessioned 2013-10-09T02:45:34Z
dc.date.available 2013-10-09T02:45:34Z
dc.date.issued 2013-10-09
dc.identifier AIM-946
dc.identifier http://hdl.handle.net/1721.1/6461
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description Constructing self-referential systems, such as Brian Smith'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.
dc.format 1625825 bytes
dc.format 1279151 bytes
dc.format application/postscript
dc.format application/pdf
dc.language en_US
dc.relation AIM-946
dc.title Reification without Evaluation


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account