Guy L. Steele. Common LISP: The Language. Digital Press (1984). This article was processed using the L a T E X macro package with LLNCS style  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Label-Selective Lambda-Calculus Syntax and Confluence - Aït-Kaci, Garrigue (1995) (2 citations) (Correct)
....argument selection and reduction commute. Keywords. Calculus, record calculus, concurrency, communication. 1 Synopsis Many modern programming languages allow specifying arguments of functions and procedures by symbolic keywords as well as using the traditional and natural numeric positions [16, 12, 4]. Symbolic keywords are usually handled as syntactic sugar and compiled away as numeric positions. This is made easy if the language does not support currying (like Common LISP or ADA) Even if currying is supported and the situation reduced to numeric positions, it is allowed strictly in a ....
Guy L. Steele. Common LISP: The Language. Digital Press (1984). This article was processed using the L a T E X macro package with LLNCS style
Explicit substitutions for the lambda Delta-calculus - Barthe, Kamareddine.. (Correct)
.... the CPS translation maps simply typable Deltaexp terms to simply typable exp terms and generalises Kolmogorov s double negation translation. The motivation for this work is three fold: 1. control like operators play a crucial role in functional programming languages, such as LISP [30], SML [2] Scheme [12] etc. We will only be able to claim that explicit substitutions provide a bridge between higher order rewriting systems and their implementation if the theory of explicit substitutions can be extended among other to control like operators; 2. control like operators and ....
G. L. Steele. Common Lisp: The Language. Digital Press, Bedford, MA, 1984. This article was processed using the L a T E X macro package with LLNCS style
Characterizing the Paralation Model using Dynamic Assignment - Eric Freeman (Correct)
....for communicating between paralations. 2.1 Representations We define a field to be an abstract data type consisting of four procedures: field ref, field set , field index, and field map. Our abstract type is implemented through a general record facility similar to defstruct of Common Lisp[8]. We represent a field as a record structure containing a vector and a pointer to an index field. define record field (vector index ) Here define record defines a predicate, field , and three procedures: make field, field vector, and field index. Figure 1 displays the relationship of the ....
....paralation to a location in the target paralation. These pointers are created by finding the position of each element of source in target using elwise to apply the procedure field position to every element of source. The procedure field position is similar to the Common Lisp function position[8]. This procedure has two parameters, a value and a field, and returns the integer site of the first occurrence of the value in the field. If the value does not occur in the field, false is returned. Since we only find the first position of each element, we lose information for one to many ....
Guy L. Steele Jr.: Common LISP: The Language Second Edition. Digital Press, 1990. This article was processed using the L a T E X macro package with LLNCS style
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