Alan Bawden and Jonathan Rees. Syntactic closures. 1988 ACM Conference on Lisp and Functional Programming, pages 86--95. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Lisp - Almost a whole Truth! - Queinnec (1989) (Correct)
....is under progress. It is obtained by code walking the Lisp code and translating it to C. The extension towards reflection is worth presenting. Reflection has been introduced in [des Rivieres Smith 84] discussed and refined in [Friedman Wand 84] Wand Friedman 86] Danvy Malmkjaer 88] Bawden 88] Adding some reflective capabilities to this interpreter is straightforward. At any time, the content of the e, r, k or ss registers of the virtual machine are always first class entities and therefore do not need to be reified 8 . We just provide the hooks so the user may be given these ....
Alan Bawden Reification without Evaluations, 1988 ACM Conference on Lisp and Functional Programming, pp 342--351, Snowbird, Utah.
The Scheme of Things: Implementing Lexically Scoped Macros - Rees (1993) (4 citations) Self-citation (Rees) (Correct)
....first two options. Option 1, using ordinary pairs but unusual identifiers for added text, corresponds to the algorithm described in [5] Option 2, with ordinary pairs and unusual identifiers, corresponds to Kohlbecker s algorithm [8] Option 2 also more or less encompasses syntactic closures [1], which use ordinary symbols but wraps them inside unusual surrounding structure. The implementation I will describe is a version of option 1. It is basically a transcription into Scheme of the algorithm presented in [5] A transcription function accepts and returns S expressions in the usual way. ....
Alan Bawden and Jonathan Rees. Syntactic closures. 1988 ACM Conference on Lisp and Functional Programming, pages 86--95.
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