Guy L. Steele. Common Lisp, the Language, second edition. Digital Press, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....for dynamic applications where performance is important. The experiment Our dataset consists of sixteen programs written by fourteen programmers. Two programmers submitted more than one program. This was also the case in the original study. Twelve of these entries were written in Common Lisp [2], and the other four were in Scheme [3] All of the subjects were selfselected volunteers recruited from an Internet newsgroup. To the extent possible we duplicated the circumstances of the original study. We used the same problem statement (slightly edited but essentially unchanged) the same ....

Guy L. Steele. Common Lisp, the Language, second edition. Digital Press, 1990.

....three subunits. The second study involves a nine residue peptide from amyloid, a small number (8) of ambiguous measurements and two di erent interfaces between an inde nitely repeating group of subunits. In all the tests discussed below, the AmbiPack algorithm is implemented in Common Lisp [20], running on a Sun Ultra 1 workstation. All constraints used involved carbon carbon distances because they are commonly measured in solid state NMR experiments, rather than distances to hydrogen, which are currently more common in solution NMR spectroscopy. 2.4.1 P22 Tailspike Protein The rst ....

Guy L. Steele Jr. Common Lisp. Digital Press, Bedford, MA, second edition, 1990.

....which substantially differs from the one presented here. As Icsla is energy less, pausing a group does not collect energy and can be performed lazily. Also, Icsla does not have any of the notifications of Quantum. Let us observe that termination notification is a generalisation of unwind protect [49]. Hieb and Dybvig [21] spawn operator returns a controller, which can be invoked to suspend or restart part of a computation tree; their approach relies on a notion of partial continuation. 4.2 Parallel and Distributed Computing Unix like operating systems offer a different model to control ....

Guy Lewis Steele, Jr. Common Lisp. The Language. Digital Press, second edition, 1990.

.... a linked list of activation records; it usually involves some copy for stack based implementation [Clinger 88, Hieb Dybvig Bruggeman 90] 1 Semantical Framework This section presents much of the semantics of a Scheme like language and formalizes our conception of dynamic extent, see also [Steele 90, chapter 3] The term extent refers to a period of time: the lifetime of an entity 2 . Any entity of Scheme has an indefinite extent i.e. entities exist forever. In most languages (Scheme excepted) applications have a dynamic extent. The extent of the application of a function on its arguments ....

.... Dybvig Bruggeman 90] Once a partial continuation is reified, the corresponding stack slice is considered as frozen and must not be overwritten before the Garbage Collector unfreezes it. 6 It is a simple exercise to write the structured lexical nonlocal exit facilities of Common Lisp, see [Steele 90] block and return from with this variant of splitter. Page 6 Let us only consider push and pop as the only operations on the evaluation stack. Push allocates new activation records and increments the stack pointer (SP) while pop just decrements it. Observe that pop is non destructive. We must ....

Guy L. Steele Jr., Common Lisp, the Language, Second Edition, Digital Press, Burlington MA, 1990.

....an unexpected number of arguments, and we maintain this semantics for call with values. For a continuation expecting a single value, one approach is to ignore the extra values when more than one value is received and to generate a special value when no values are received, as in Common Lisp [8]. Another approach is to ignore extra values but signal an error when no values are received. We feel that either approach tends to mask programming errors without adding significantly to the flexibility of the language. Thus, we have chosen to signal an error both when no values are received and ....

....The only di#erence is that a case dispatch on the number of values received must be performed to determine which clause to execute. As with case lambda, the first clause that accepts the number of values provided is chosen as the consumer. The optional argument interfaces provided by Common Lisp [8] and by other Scheme systems, e.g. MIT Scheme [6] can be handled in a similar manner. 3.6 Common Lisp multiple values interface Our strategy can be adapted to implement the Common Lisp multiple values interface e#ciently. Common Lisp provides two basic interfaces for receiving multiple values: ....

Guy L. Steele Jr. Common Lisp. Digital Press, second edition, 1990.

....which substantially differs from the one presented here. As Icsla is energy less, pausing a group does not collect energy and can be performed lazily. Also, Icsla does not have any of the notifications of Quantum. Let us observe that termination notification is a generalisation of unwind protect [32]. Hieb and Dybvig [14] spawn operator returns a controller, which can be invoked to suspend or restart part of a computation tree; their approach relies on a notion of partial continuation. There is an analogy between Unix fork and the construct parallel: fork duplicates processes, while they ....

Guy Lewis Steele, Jr. Common Lisp. The Language. Digital Press, second edition, 1990.

....three subunits. The second study involves a nine residue peptide from fi amyloid, a small number (8) of ambiguous measurements and two different interfaces between an indefinitely repeating group of subunits. In all the tests discussed below, the AmbiPack algorithm is implemented in Common Lisp [7], running on a Sun Ultra 1 workstation. All constraints used involved carbon carbon distances because they are commonly measured in solid state NMR experiments, rather than distances to hydrogen, which are currently more common in solution NMR spectroscopy. 4.1 P22 Tailspike Protein The first ....

Guy L. Steele Jr. Common Lisp. Digital Press, Bedford, MA, second edition, 1990.

....by the languages. Rather than attempt to restrict such practices by setting down many proscriptions or defining a large number of interface routines, this task group simply entreats developers to attempt to refrain from them, by observing the guidelines recommended in the standard references [15, 16, 17, 18]. The next two sections describe file I O and interactive graphic I O in greater detail. 3.4 File Input and Output Each of the approved languages provides built in, standard ways to read and write files. These are considered to be part of the VMP. From the point of view of the CWG, these standard ....

Guy Steele, Jr. COMMON LISP, the Language. Digital Press, Burlington, Massachusetts, second edition, 1990.

....and a computer scientist with Common Lisp, ML, or PROLOG. For this reason, we choose to view the concrete syntax as an inessential part of a computer language, to be modified as desired to address different communities. In particular, Chains is currently implemented with two syntaxes: Common Lisp[Ste90] style sexp syntax, and Mathematica[Wol91] style syntax. Expressions in either syntax are translated to the internal Chains representation, and computed results can likewise be viewed in either syntax. The presentation syntax for Chains used in this article is that of Mathematica. As an example ....

Guy L. Steele, Jr. Common Lisp, the language. Digital Press, second edition, 1990.

....itself. Section 3.4 describes the symbolic algebra component, which is implemented using Weyl. We conclude by describing some of the implementation issues concerning the example applications. The prototype implementation of SimLab is written using the Common Lisp Object System (CLOS)[18]: the standard object oriented version of Common Lisp. SimLab generates simulators in conventional programming languages (currently Common Lisp, C, and FORTRAN) These simulators incorporate user interface and visualization tools using X windows. Once SimLab has created a simulator and scene ....

Guy L. Steele, Jr. Common Lisp, the language. Digital Press, second edition, 1990.

....objects and immutable data. Section 4.5 shows program examples that some previous concurrent object oriented languages have difficulty with. Section 4.6 compares the design of ABCL f with other language designs. 4. 1 Overview Syntax and sequential constructs of ABCL f are borrowed from Common Lisp [69]. Unlike Common Lisp, ABCL f has a simple static type system and enforces type declarations for procedure method parameters. The current implementation of ABCL f lacks parametric polymorphism and inheritance. Types for local variables are normally inferred but monomorphic type declarations are ....

Guy L. Steel, Jr. Common Lisp, The Language, Second Edition. Digital Press, 1992.

....Window system is supported by every major workstation vendor and is usually included ( bundled ) in purchases. The collaborative working group does not limit itself to a single programming language, so a VMP must support several. At this writing, tools have been written in ANSI C [10] Common Lisp [13], and C [14] The VMP specification does not require any particular operating system because this would have limited distribution of the tools to sites that used it. In fact, the VMP specification prohibits writing tools that depend on any particular operating system. Standard programming ....

Guy Steele, Jr. COMMON LISP, the Language. Digital Press, Burlington, Massachusetts, second edition, 1990.

....allow expressions or variables to be evaluated dynamically in a first class environment, a form of modular programming can be supported. First class environments, however, are inherently dynamic in nature, so that module interfaces often cannot be fully determined until run time. Common Lisp s [11] package system uses symbol tables to represent modules. Symbols defined as external in a package can be exported. Various mechanisms are available to access or to import exported symbols. The package system could be used as the low level implementation for fully developed (static) modules. The ....

Guy L. Steele Jr. Common Lisp, the Language. Digital Press, second edition, 1990.

....implementation itself. Section 3.3 describes the symbolic algebra component, which is implemented using Weyl. We conclude by describing some of the implementation issues concerning the example applications. The prototype implementation of SimLab is written using the Common Lisp Object System (CLOS)[19]: the standard object oriented version of Common Lisp. SimLab generates simulators in conventional programming languages (currently Common Lisp, C, and FORTRAN) These simulators incorporate user interface and visualization tools based on X windows and CLM[7] Once SimLab has created a simulator ....

Guy L. Steele, Jr. Common Lisp, the language. Digital Press, second edition, 1990.

....(f ) The with syntax form introduces pattern variable bindings within the scope of its body; its definition is shown later. This same mechanism may be used to create aggregate identifier names typically required when defining structure definition constructs such as Common Lisp defstruct [16], as macros. The procedure below constructs an implicit identifier using an aggregate name of the form hstructure namei hfield namei, from a structure name identifier s id and a field name identifier f id: define aggregate identifier (lambda (s id f id ) let ( s name (symbol string ....

Guy L. Steele Jr. Common Lisp, the Language. Digital Press, second edition, 1990.

....of the Revised 4 Report signals an error in such cases, but the text of the report does not appear to say whether passing the wrong number of arguments is an error, much less that an error must be signaled. received and to generate a special value when no values are received, as in Common Lisp [8]. Another approach is to ignore extra values but signal an error when no values are received. We feel that either approach tends to mask programming errors without adding significantly to the flexibility of the language. Thus, we have chosen to signal an error both when no values are received and ....

....The only difference is that a case dispatch on the number of values received must be performed to determine which clause to execute. As with case lambda, the first clause that accepts the number of values provided is chosen as the consumer. The optional argument interfaces provided by Common Lisp [8] and by other Scheme systems, e.g. MIT Scheme [6] can be handled in a similar manner. 3.6 Common Lisp multiple values interface Our strategy can be adapted to implement the Common Lisp multiple values interface efficiently. Common Lisp provides two basic interfaces for receiving multiple ....

Guy L. Steele Jr. Common Lisp. Digital Press, second edition, 1990.

....are represented and computed efficiently. Proof Techniques FR 92 5451 02 15 3.5.2 The Implementation In the implementation of NEVER, all types and literals of those types are represented by terms, except for integers, which are implemented directly. Since the implementation is in Common Lisp [Ste90] this means that EVES integers are represented by the integers of the underlying Lisp implementation. Other data types, such as arrays, are represented by terms that are in turn represented by Lisp expressions, not by Lisp arrays. This is also true for the other EVES types including records, ....

Guy L. Steele Jr. Common Lisp, The language. Digital Press, Bedford, Massachusetts, second edition, 1990.

....with Lisp. It appeared in McCarthy s Lisp 1. 0 [38] as a bug and became a feature in all later implementations, such as MacLisp [42] Gnu Emacs Lisp [37] Even modern dialects of the language favouring lexical scope provide some form of dynamic binding, with special declarations in Common Lisp [64], or even simulate dynamic binding by lexically scoped variables as in MIT Scheme s fluid let [29] Let us here and now define the notions of binding and scope as we use them in this article. A binding is an association between a name (or a variable) and a value. The scope of a name binding is the ....

....that did not appear in the journal version. 2 a block structure organisation. Variables following the lexical scope rule are said to be lexically scoped variables or lexical variables. On the contrary, if the scope of a name cannot be determined statically, the scope is said to be indefinite [64] as references to the name may occur anywhere in the program. Program execution introduces the notion of dynamic extent. The dynamic extent of an expression is the lifetime of this expression, starting and ending when control enters and exits this expression. A dynamic binding is an association ....

[Article contains additional citation context not shown here]

Guy Lewis Steele, Jr. Common Lisp. The Language. Digital Press, second edition, 1990.

....about and acting upon itself. A language architecture where reflection is paired with metaclasses results in an object oriented system that is open ended and easily extendable since the metaclasses provide hooks to extend or modify an existing kernel. Examples of such systems are CLOS [Kee89, Ste90, LM91, KdRB91] and ObjVlisp [Coi87] In addition, the introspective abilities of metaclassbased systems provide the basis for a range of program analysis tools and browsers. Analysis tools typically need to have access to metalevel information of the system at hand to answer queries about the ....

Guy L. Steele. Common Lisp, The Language. Digital Press, Bedford, MA, second edition, 1990. ISBN 1-55558-041-6.

....with G and D as defined above, Scope(G; D) fRegistry; TransportVehicle; Car; Truck; Trailerg. Definition 13 (Method map) For a given method signature, a method map is a mapping from vertices to method bodies. In CLOS terminology, a method map defines methods for a single generic function [Ste90]. Method bodies are simply sequences of statements and expressions in some object oriented programming language L for example C . The principles of propagation patterns do not rely on the specifics of the language L used in the method bodies. Therefore, method bodies are considered as black boxes ....

Guy L. Steele. Common Lisp, The Language. Digital Press, Bedford, MA, second edition, 1990. ISBN 1-55558-041-6.

....reduction system where the notion of extent is made explicit. 6 The CPP calculus The notion of extent is not easy to de ne for a parallel language with rst class continuations. First, we informally de ne it and then we represent it explicitly in a new reduction system CPP. According to [13] [28], the extent refers to a period of time: the lifetime of an object or a construct. In Scheme, the extent of the application of a function f on its argument v is the time during which is computed the body of the function f , this includes the time taken by the computation of all subforms that ....

Guy Lewis Steele, Jr. Common Lisp. The Language. Digital Press, second edition, 1990. 11

....Working Group. This document assumes familiarity with the software design model chosen by the Working Group, as described in the earlier reports [1, 2, 3] It also assumes some familiarity with the Common Lisp programming language, including the Common Lisp Object System, as described in [4]. In this document CL is sometimes used as an abbreviation for Common Lisp, and CLOS for the Common Lisp Object System. Along with [3] this document provides information needed for two purposes. The first purpose is to write site independent components of tools in the Common Lisp language, which ....

....must not alter the CL readtable to make it case sensitive. In the Lisp programming community it is usual to type source code in lower case. Thus the operation name Fetch All in [3] becomes fetch all in CL. If this simple naming convention would determine a name that is already defined in [4], a different name must be used. Therefore, the following subsitutions are necessary: Class name Attribute name CL name Grid Values values grid values Block beam block 6 Lisp data types It is necessary to specify which CL data types must be used to represent the values of attributes (e.g. those ....

[Article contains additional citation context not shown here]

Guy Steele, Jr. COMMON LISP, the Language. Digital Press, Burlington, Massachusetts, second edition, 1990.

No context found.

Guy L. Steele Jr.: Common LISP, Second Edition, Digital Press, 1990 173

No context found.

Guy L.Steele Jr. COMMON LISP . Second Edition. Digital Press. 1990.

No context found.

Guy L. Steele. COMMON LISP. Digital Press, second edition, 1990.

First 50 documents

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