Results 111 to 120 of about 25,732 (152)
Some of the next articles are maybe not open access.

S-1 Common Lisp implementation

Proceedings of the 1982 ACM symposium on LISP and functional programming - LFP '82, 1982
We are developing a Lisp implementation for the Lawrence Livermore National Laboratory S-1 Mark IIA computer. The dialect of Lisp is an extension of COMMON Lisp [Steele;1982], a descendant of MacLisp [Moon;1974] and Lisp Machine Lisp [Weinreb;1981]).
Rodney A. Brooks   +2 more
openaire   +2 more sources

An overview of COMMON LISP

Proceedings of the 1982 ACM symposium on LISP and functional programming - LFP '82, 1982
A dialect of LISP called “COMMON LISP” is being cooperatively developed and implemented at several sites. It is a descendant of the MACLISP family of LISP dialects, and is intended to unify the several divergent efforts of the last five years. We first give an extensive history of LISP, particularly of the MACLISP branch, in order to explain in context
openaire   +2 more sources

Einbettung von Standard LISP in COMMON LISP

1989
Im Verlauf der Entwicklung von LISP entstand eine Vielzahl unterschiedlicher Dialekte, die sich erheblich in der Menge der zur Verfugung gestellten Datentypen und Funktionen unterscheiden (vgl. Stoyan [1980]). So findet man zwar bei allen LISP-Dialekten die Datentypen Symbol, ganze Zahl und Liste sowie die Grundfunktionen CAR, CDR, CONS und COND; aber ...
Elisabeth Feldmar, Rüdiger Esser
openaire   +2 more sources

Common Lisp

Celebrating the 50th Anniversary of Lisp, 2008
This paper summarizes a talk given at "Lisp50@OOPSLA," the 50th Anniversary of Lisp workshop, Monday, October 20, 2008, an event co-located with the OOPSLA'08 in Nashville, TN, in which I offered my personal, subjective account of how I came to be involved with Common Lisp and the Common Lisp standard, and of what I learned from the process.The account
openaire   +2 more sources

Common Lisp relations: an extension of Lisp for logic programming

Proceedings. 1988 International Conference on Computer Languages, 2003
The author presents a set of relational constructs that support logic programming in the Common Lisp framework. These constructs support locally defined and first-class relations, an interface between function and relation-calling logical variables as first-class Lisp objects, and the ability to define relations over Common Lisp structures.
openaire   +2 more sources

Timed Common Lisp

ACM SIGART Bulletin, 1996
The two key features of Deliberation Scheduling and Anytime Algorithms are the duration of the computation and the resulting quality. Clearly, quality can be difficult to define and highly dependent on the domain. Duration, on the other hand, seems straightforward: how long the computation takes. But on what processor? Should the processor matter? What
Paul R. Cohen, Scott D. Anderson
openaire   +2 more sources

Syntax and semantics of a persistent Common Lisp

Proceedings of the 1994 ACM conference on LISP and functional programming - LFP '94, 1994
The syntax and semantics for UCL+P, a persistent Common Lisp, are defined. The definition provides adequate support for persistence while maintaining the look-and-feel of Common Lisp. All Lisp data types (except streams) can be made persistent. Persistence is conferred automatically on non-symbol values when they become part of a persistent data ...
J. H. Jacobs, M. Swanson
openaire   +2 more sources

Common Lisp Framework

1993
Abstract : The principal goal of the COMMON LISP Framework project was to support Strategic Computing (SC) contractors with a comprehensive, state-of-the- art programming framework for the development and evolution of COMMON LISP programs. The CLF has affected the technical community by shaping both the structure of modern programming environments and ...
openaire   +2 more sources

Constraint solving in common Lisp

Proceedings of the 2007 International Lisp Conference, 2007
Constraint solving has become an established approach for the handling of complex combinatorial and scheduling problems. We present a constraint solver framework that enables the interchange of most solver aspects through its extensive modular design. Here, we especially focus on the search protocol design.
openaire   +2 more sources

Manipulating sets in common Lisp

ACM SIGPLAN Lisp Pointers, 1989
Sets are fundamental theoretical elements and yet Common Lisp does not provide any comprehensive representation for them. Several representations for sets are available, but they have serious problems. This paper defines a small family of primitive operations and uses them to evaluate existing Common Lisp set representations.
openaire   +2 more sources

Home - About - Disclaimer - Privacy