نتایج جستجو برای: پروتکل lisp

تعداد نتایج: 7487  

1994
Scott D. Anderson Adam Carlson David L. Westbrook David M. Hart Paul R. Cohen

The paper describes two separate but synergistic tools for running experiments on large Lisp systems such as planning systems, by which we mean systems that produce plans and execute them in some kind of simulator. The rst tool, called Clip (Common Lisp Instrumentation Package), allows the researcher to deene and run experiments, including experimental conditions (values for parameters of the p...

Journal: :CoRR 2007
Catherine Recanati

This paper is an introduction to Lambdix, a lazy Lisp interpreter implemented at the Research Laboratory of the University of Paris XI (Laboratoire de Recherche en Informatique, Orsay). Lambdix was devised in the course of an investigation into the relationship between the semantics of programming languages and their implementation; it was used to demonstrate that in the Lisp domain, semantic c...

Journal: :Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics 1979

Journal: :Behavior Research Methods & Instrumentation 1979

1993
Richard C. Waters

This technical report gathers together three papers that were written during 1992 and 1993 and submitted for publication in ACM Lisp Pointers. Chapter 1 \Using the New Common Lisp Pretty Printer" explains how the pretty printing facilities that have been adopted as part of the forthcoming Common Lisp standard can be used to gain detailed control over the printing of lists. As an example, it sho...

Journal: :J. UCS 2008
António Menezes Leitão

UCL-GLORP is a Common Lisp implementation and extension of GLORP (Generic Lightweight Object-Relational Persistence), an Object-Relational Mapper for the Smalltalk language. UCL-GLORP is now a mature framework that largely extends GLORP and that takes advantage of some of Common Lisp unique features. This paper illustrates UCL-GLORP and discusses some of the challenges that we faced in order to...

Journal: :Theor. Comput. Sci. 1978
Peter Padawitz

Transformations of graphlike expressions are called correct if they preserve a given functional semantics of the expressions. Combining the algebraic theories of graph grammars (cf. [lo]) and programming language semantics (cf. [l]) it will be proved that the correctness of transformation rules carries over to the correctness of derivations via such rules. Applying this result to LISP we show t...

2008
Christophe Rhodes

This paper describes the development of an implementation of Common Lisp with the peculiarity that it is bootstrappable neither solely from itself, nor from some other language, but rather from a variety of other Common Lisp implementations. We explain the motivation for this bootstrap strategy, discuss some of the technical details involved in achieving it, and attempt to assess the technical ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید