Reification without Evaluation
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 s...
Main Author: | Bawden, Alan |
---|---|
Language: | en_US |
Published: |
2004
|
Online Access: | http://hdl.handle.net/1721.1/6461 |
Similar Items
-
Normalizing masochism: subversion and reification of hegemony in Larry Kramer’s The Normal Heart
by: Tay, Lai Kit, et al.
Published: (2016) -
Normalizing masochism: subversion and reification of hegemony in Larry Kramer's The Normal Heart
by: Tay, Lai Kit, et al.
Published: (2016) -
Reification by Parametricity: Fast Setup for Proof by Reflection, in Two Lines of Ltac
by: Gross, Jason, et al.
Published: (2021) -
Implementing Distributed Systems Using Linear Naming
by: Bawden, Alan
Published: (2004) -
Analyzing the State Behavior of Programs
by: Bawden, Alan
Published: (2008)