This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
668.0 Pizza into Java: Translating theory into practice - Odersky (1997)(Correct)
Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higher-order functions, and algebraic data types. Pizza is defined by translation... / tell you. Algol had strong typing Lisp had heap allocation with garbage br OOP in a language with state. Lisp and Symbolic Computation
379.3 Compiler Transformations for High-Performance Computing - Bacon (1993)(Correct)
In the last three decades a large number of compiler transformations for optimizing programs have been implemented. Most optimizations for uniprocessors reduce the number of instructions executed by t... / investigation of optimizations for LISP and functional languages Clark and br including C and many dialects of Lisp address this problem by
376.0 The Tera Computer System - Alverson, Callahan, Cummings.. (1990)(Correct)
this document are
those of Tera Computer Company and should not be interpreted
as representing the official policies, either expressed or implied, of
DARPA or the U. S. Government. unknown The Tera Co... / non-numeric languages like Lisp and Prolog and highly applicative br physical processors. The price performance ratio of the system is
350.5 Imperative functional programming - Jones, Wadler (1993)(Correct)
We present a new model, based on monads, for performing input/output in a non-strict, purely functional language. It is composable, extensible, efficient, requires no extensions to the type system, an... / mostly-functional languages such as Lisp or SML deal successfully with br programming in ACM Conference on Lisp and Functional Programming MIT
342.0 A Metaobject Protocol for C++ - Chiba (1995)(Correct)
This paper presents a metaobject protocol (MOP)
for C++. This MOP was designed to bring the
power of meta-programming to C++ programmers.
It avoids penalties on runtime performance
by adopting a new m... / been included in languages such as Lisp ABCL and to a lesser br statement of Cas macros do in Lisp. The translated code may look like
263.7 Optimizing ML with Run-Time Code Generation - Leone, Lee (1995)(Correct)
We describe the design and implementation of a compiler that automatically translates ordinary
programs written in a subset of ML into code that generates native code at run time. Run-time
code genera... / dynamically linked and executed. Lisp systems have long provided br can specify the construction of Lisp terms at the source level rather
259.0 The Object-Oriented Database System Manifesto - Atkinson, Bancilhon, DeWitt.. (1989)(Correct)
This paper attempts to define an object-oriented database system. It describes the main features and characteristics that a system must have to qualify as an objectoriented database system. We have se... / and operating systems Fortran Lisp Cobol and SQL are good examples br all the systems derived from Lisp. In the second category we find
239.5 Soft Typing with Conditional Types - Aiken, Wimmers, Lakshman (1994)(Correct)
We present a simple and powerful type inference method
for dynamically typed languages where no type information
is supplied by the user. Type inference is reduced to the
problem of solvability of a s... / typed languages such as Lisp and Scheme impose no type br in his algorithm for analyzing Lisp programs Type schemes have
237.0 Partial-Order Planning: Evaluating Possible Efficiency Gains - Barrett, Weld (1994)(Correct)
Although most people believe that planners that delay step-ordering decisions as long as possible are more efficient than those that manipulate totally ordered sequences of actions, this intuition has... / but these methods A Common Lisp implementation of this algorithm br planners were implemented in Common Lisp using a shared set of data
229.7 Scripting: Higher Level Programming for the 21st Century - Ousterhout (1997)(Correct)
Scripting languages such as Perl and Tcl represent a very different style of programming than system programming languages such as C or Java. Scripting languages are designed for "gluing" applications... / higher level languages such as Lisp Fortran and Algol began to br language. For example the Lisp family of languages lies somewhere
218.1 Evolving Artificial Neural Networks - Yao (1999)(Correct)
Learning and evolution are two fundamental forms of adaptation. There has been a great
interest in combining learning and evolution with artificial neural networks (ANNs) in recent
years. This paper (... / lead to quite different training performance. A typical cycle of the br an architecture. Given some performance optimality criteria e.g.
194.2 Evolution of Homing Navigation in a Real Mobile Robot - Floreano, Mondada (1996)(Correct)
In this paper we describe the evolution of a discrete-time recurrent neural network to control a real mobile robot. In all our experiments the evolutionary procedure is carried out entirely on the phy... / classifier systems and Lisp code and the large br the symbolic expressions found in Lisp also termed Genetic Programming
187.6 The Evolution of Evolvability in Genetic Programming - Altenberg (1994)(Correct)
Introduction
The choice of genetic operators and representations has proven critical to the performance
of genetic algorithms (GAs), because they comprise dual aspects of the same process: the
creatio... / data-structure implementation or LISP versus some other programming br of evolvability as a measure of performance for genetic algorithms
180.8 Lazy Task Creation: A Technique for Increasing the Granularity of.. - Mohr, Kranz, Halstead, Jr. (1990)(Correct)
Many parallel algorithms are naturally expressed at a fine level of granularity, often finer than a MIMD parallel system can exploit efficiently. Most builders of parallel systems have looked to eithe... / possible with previous parallel Lisp systems. Key words and phrases br process migration parallel Lisp task management. Introduction
175.8 Zeus: A System for Algorithm Animation and Multi-View Editing - Brown (1992)(Correct)
Algorithm animation is a form of program visualization that is concerned with
dynamic and interactive graphical displays of a program's fundamental operations.
This paper describes the Zeus algorithm ... / part of the typescript contains a Lisp read-eval-print loop with br work includes exploring high-performance personal computing distributed
162.8 Programmable Active Memories: a Performance Assessment - Bertin, Roncin, Vuillemin (1993)(Correct)
We present some quantitative performance measurements for the computing power of Programmable
Active Memories (PAM), as introduced by [BRV89]. Based on Field Programmable
Gate Array (FPGA) technology,... / programming language we use Lisp CTou and Esterel Ber br . plain text to for C or Lisp or Pascal. source code.
161.0 The Sprite Network Operating System - Ousterhout, Cherenson, Douglis.. (1988)(Correct)
Sprite is a new operating system for networked uniprocessor and multiprocessor workstations with large physical memories. It implements a set of kernel calls much like those of 4.3 BSD UNIX, with exte... / with special hardware support for Lisp applications Although one of br machines which provide high performance even for diskless workstations.
159.2 Nesl: A Nested Data-Parallel Language - Blelloch (1990)(Correct)
This report describes Nesl, a strongly-typed, applicative, data-parallel language. Nesl is
intended to be used as a portable interface for programming a variety of parallel and vector
supercomputers, ... / language with no side effects and a Lisp-like syntax. The language br serial access such as lists in Lisp or ML. Nesl is the first
153.2 Tcl: An Embeddable Command Language - Ousterhout (1990)(Correct)
Tcl is an interpreter for a tool command language. It consists of a library package that is embedded in tools (such as editors, debuggers, etc.) as the basic command interpreter. Tcl provides (a) a pa... / Section compares Tcl to Lisp Emacs and NeWS and Section br whether it is C Forth Lisp or Postscript could
150.7 Challenges in Evolving Controllers for Physical Robots - Mataric, Cliff (1996)(Correct)
This paper discusses the feasibility of applying evolutionary methods
to automatically generating controllers for physical mobile robots.
We overview the state of the art in the field, describe some o... / primitive constructs such as Lisp programs. This abstraction of br robot controller represented with Lisp S-expressions and compare it to
148.4 Branch Prediction For Free - Ball (1993)(Correct)
ing with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications D... / scanner processer C xlisp Lisp interpreter C br prediction to improve program performance by identifying frequently
142.2 Genetic Programming for Feature Discovery and Image Discrimination - Tackett (1993)(Correct)
We apply Genetic Programming (GP) to the development of a processing tree
for the classification of features extracted from images: measurements from a set of input
nodes are weighted and combined t... / a population of randomly generated LISP programs represented by their parse br by their parse trees. The LISP programs and the trees which
137.1 Conditional Effects in Graphplan - Anderson (1998)(Correct)
Graphplan has attracted considerable interest because of its extremely high performance, but the algorithm's inability to handle action representations more expressive than STRIPS is a major limitatio... / Mark Peot who provided an initial Lisp implementation of basic Graphplan. br implementation written in Common Lisp. Experiments were carried out on a
133.3 Specialization of Perceptual Processes - Horswill (1994)(Correct)
In this report, I discuss the use of vision to support concrete, everyday activity. I
will argue that a variety of interesting tasks can be solved using simple and inexpensive
vision systems. I will p... / C. . tour-demo.lisp br C. . vision.lisp
131.9 An Industrial Strength Theorem Prover for a Logic Based on Common Lisp - Kaufmann, Moore (1997)(Correct)
ACL2 is a re-implemented extended version
of Boyer and Moore's Nqthm and Kaufmann's Pc-Nqthm,
intended for large scale verification projects. This paper
deals primarily with how we scaled up Nqthm's l... / Prover for a Logic Based on Common Lisp Matt Kaufmann y and J br large applicative subset of Common Lisp -while preserving the use of
123.4 Understanding and Extending Graphplan - Kambhampati, Parker, Lambrecht (1997)(Correct)
We provide a reconstruction of Blum and Furst's Graphplan algorithm, and use the reconstruction
to extend and improve the original algorithm in several ways. In our reconstruction,
the process of grow... / and David Smith for making their Lisp implementation of Graphplan br the planners were written in Lisp and run on a Sparc Notice the
98.7 Space-Efficient Closure Representations - Shao, Appel (1994)(Correct)
Many modern compilers implement function calls (or returns)
in two steps: first, a closure environment is properly
installed to provide access for free variables in the target
program fragment; second... / To appear in ACM Conference on Lisp and Functional Programming June br in continuation-passing style. Lisp and Symbolic Computation
96.9 Cache Performance of the SPEC92 Benchmark Suite - Gee (1993)(Correct)
The SPEC92 benchmark suite consists of twenty public-domain, non-trivial programs that are
widely used to measure the performance of computer systems, particularly those in the Unix
workstation market... / Maxwell's equation solver xlisp C Lisp interpreter solving the nine queens br -Cache Performance of the SPEC Benchmark Suite
96.9 Cache Performance of the SPEC Benchmark Suite - Gee, Hill, Pnevmatikatos, Smith (1993)(Correct)
The SPEC benchmark suite consists of ten public-domain, non-trivial programs that are widely used to
measure the performance of computer systems, particularly those in the Unix workstation market.
The... / Mesh generation program xlisp C Lisp interpreter solving eight queens br Cache Performance of the SPEC Benchmark Suite
95.0 A Fast File System for UNIX - Mckusick, Joy, Leffler, Fabry (1984)(Correct)
This paper describes the changes from the original 512-byte UNIX file system
to file the new system released with the 4.2 Berkeley Software Distribution. It
presents the motivations for the changes, t... / Spice and a file system for a LISP environment A good br D. . Operating Systems Performance-measurements operational
90.7 Polly: A Vision-Based Artificial Agent - Horswill (1993)(Correct)
In this paper I will describe Polly, a low cost visionbased
robot that gives primitive tours. The system
is very simple, robust and efficient, and runs on a
hardware platform which could be duplicated... / Finally I will discusses the performance and failure modes of the br modules such as the navigator. Performance At present the system runs
85.7 Run-time Code Generation and Modal-ML - Philip Wickline (1998)(Correct)
This paper presents early experience with a typed programming language and compiler for run-time code
generation. The language is an extension of the SML language with modal operators, based on the
... / backquote and antiquote notation of Lisp macros for example provides an br The difficulty in C and Lisp on the other hand is that there
81.8 Improving the Performance of Speculatively Parallel Applications on.. - Olukotun, Hammond, Willey (1999)(Correct)
Hydra is a chip multiprocessor (CMP) with integrated support for thread-level speculation. Thread-level
speculation provides a way to parallelize sequential programs without the need for data dependen... / the work of Knight in the context of LISP However the Multiscalar br languages Proceedings of the ACM Lisp and Functional Programming
81.4 A Cooperative Coevolutionary Approach to Function Optimization - Potter, De Jong (1994)(Correct)
A general model for the coevolution of cooperating species is presented. This model is
instantiated and tested in the domain of function optimization, and compared with a
traditional GA-based function... / such as neural networks and Lisp programs. At the same time br They suggest ways in which the performance of GA and other EA-based
81.1 Accelerating Partial-Order Planners: Some Techniques for Effective.. - Gerevini (1996)(Correct)
We propose some domain-independent techniques for bringing well-founded partialorder
planners closer to practicality. The first two techniques are aimed at improving
search control while keeping overh... / and with our improved strategy. The Lisp code for our techniques and for the br because it is well-known and the Lisp code is readily available. The
79.9 Extending Graphplan to Handle Uncertainty Sensing Actions - Weld (1998)(Correct)
If an agent does not have complete information about the world-state, it must reason about alternative possible states of the world and consider whether any of its actions can reduce the uncertainty. ... / Mark Peot who provided an initial Lisp implementation of basic Graphplan. br SGP is implemented in Allegro Common Lisp . and accepts variablized action
75.3 The Conceptual Basis for Mediation Services - Wiederhold, Genesereth (1996)(Correct)
Mediator modules comprise a layer of intelligent middleware services in information
systems, linking data resources and application programs. Earlier programs that led
to the concept of mediation were... / are programmed in languages as lisp. If optimization is crucial to br are only partially related to performance. Having identifiable and
75.3 ACL2: An Industrial Strength Version of Nqthm - Kaufmann, Moore (1996)(Correct)
ACL2 is a reimplemented extended version of Boyer and Moore's
Nqthm and Kaufmann's Pc-Nqthm, intended for large scale verification
projects. However, the logic supported by ACL2 is compatible with the... / the applicative subset of Common Lisp. The decision to use an industrial br that functions be total. Common Lisp functions are not total and this is
75.3 Evolutionary Algorithms for Neural Network Design and Training - Branke (1995)(Correct)
Neural networks and genetic algorithms are two relatively young research areas
that were subject to a steadily growing interest during the past years. Both models
are inspired by nature, but whereas n... / encoding but theirs is in terms of Lisp-Sexpressions. Saha and br suggested an approach that uses LISPS expressions for representation.
74.2 Sparcle: An Evolutionary Processor Design for Large-Scale.. - Anant Agarwal (1993)(Correct)
Sparcle is a processor chip developed jointly by MIT, LSI Logic, and SUN Microsystems,
by evolving an existing RISC architecture towards a processor suited for large-scale multiprocessors.
Sparcle sup... / constructs in parallel versions of Lisp and C that use these features. We br for our parallel versions of C and lisp was also operational for several
74.1 The Measured Cost of Conservative Garbage Collection - Zorn (1992)(Correct)
Because dynamic memory management is an important part of a large class of
computer programs, high-performance algorithms for dynamic memory management
have been, and will continue to be, of considera... / programming languages such as Lisp only recently has the technique br already successfully applied in Lisp environments can be applied to
74.0 Hints for Computer System Design - Lampson (1983)(Correct)
Studying the design and implementation of a number of computer has led to some general hints for system design. They are described here and illustrated by many examples, ranging from hardware such as ... / and programming systems such as Lisp and Mesa to application programs br choices or affect the size and performance of the entire system. There
72.7 How to Avoid Building DataBlades That Know the Value of Everything.. - Aoki (1999)(Correct)
The object-relational database management system (ORDBMS) offers many potential benefits for scientific, multimedia
and financial applications. However, work remains in the integration of domain-speci... / of nothing.and Alan Perlis A LISP programmer knows the value of br quality is a significant performance issue because it integrates the
69.5 Evolutionary Design of Neural Architectures - A Preliminary Taxonomy.. - Balakrishnan, Honavar (1995)(Correct)
This report briefly motivates current research on evolutionary design of neural
architectures (EDNA) and presents a short overview of major research issues in
this area. It also includes a preliminary... / or ANN as opposed to say LISP programs. Given the equivalence br including lambda calculus of LISP programs Turing machines Post
68.2 Iterative Type Analysis and Extended Message Splitting: Optimizing.. - Chambers, Ungar (1990)(Correct)
Object-oriented languages have suffered from poor performance caused by frequent and slow dynamically-bound procedure calls. The best way to speed up a procedure call is to compile it out, but dynam... / To Be Published In Lisp And Symbolic Computation An br - . Also to be published in Lisp and Symbolic Computation
64.6 The Implementation Of Postgres - Stonebraker (1990)(Correct)
Currently, POSTGRES is about 90,000 lines of code in C and is being used by assorted "bold and brave" early users. The system has been constructed by a team of 5 part time students led by a full time ... / of persistent CLOS Common LISP Object System on top of POSTGRES. br language in our case C or LISP Hence they have arbitrary
64.1 A Comparison of Trace-Sampling Techniques for Multi-Megabyte Caches - Kessler, HIll, Wood (1994)(Correct)
This paper compares the trace-sampling techniques of set sampling and time sampling. Using the
multi-billion-reference traces of Borg et al., we apply both techniques to multi-megabyte caches,
where s... / phase of compilation and a Scheme Lisp variant program megabytes br Terms Cache memory cache performance cold start computer
63.7 Transformational Planning Of Reactive Behavior - Drew McDermott (1992)(Correct)
Reactive plans are plans that include steps for sensing the world and coping with the data so obtained.
We investigate the application of AI planning techniques to plans of this sort in a simple simul... / features. Its syntax of course is Lisp-like. The planning problem I have br transformation which are pieces of Lisp code in the current implementation
63.7 Sri International Fastus System Muc-6 Test Results And Analysis - Appelt (1995)(Correct)
This paper will describe the version of the FASTUS system employed in MUC-6 and highlight the innovations that distinguish it from previous versions described in the literature. SRI used the FASTUS sy... / semantics were embodied solely in lisp code associated with the virtual br evaluation in and the performance of FASTUS in MUC- helped
63.6 An Evolutionary Approach to Constructing Effective Software Reuse.. - Henninger (1999)(Correct)
Repositories for software reuse are faced with two interrelated problems: acquiring the knowledge to
initially construct the repository, and modifying the repository to meet the evolving and dynamic n... / PEEL Parse and Extract Emacs Lisp extracts components from text br investigated in the domain of Emacs Lisp customizations for the GNU Emacs
63.0 Garbage Collection Can Be Faster Than Stack Allocation - Appel (1987)(Correct)
A very old and simple algorithm for garbage collection gives very good results when the physical memory is much larger than the number of reachable cells. In fact, the overhead associated with allocat... / languages with garbage collection LISP Mesa Icon ML Mainsail etc. br the cost of allocating a cell. In LISP this is typically expressed as
62.8 An Evaluation of Automatic Object Inline Allocation Techniques - Dolby, Chien (1998)(Correct)
Object-oriented languages such as Java and Smalltalk
provide a uniform object reference model, allowing objects
to be conveniently shared. If implemented directly,
these uniform reference models can s... / Languages such as Java Lisp Pool and Sather br in the manner of a traditional Lisp or Java runtime system using
57.9 A Domain-Independent Algorithm for Plan Adaptation - Hanks (1995)(Correct)
The paradigms of transformational planning, case-based planning, and plan debugging
all involve a process known as plan adaptation --- modifying or repairing an old plan so
it solves a new problem. In... / our algorithm in Common Lisp on UNIX workstations and tested it br for good problem-solving performance. Second computational
57.1 Automatic Accurate Time-Bound Analysis for High-Level Languages - Liu (1998)(Correct)
This paper describes a general approach for automatic and accurate time-bound analysis. The approach consists of transformations for building time-bound functions in the presence of partially known in... / a high-level language such as C or Lisp. The first step is to build a br compiler optimizations performance evaluation and many other
57.1 The CADE-14 ATP System Competition - Sutcliffe, Suttner (1998)(Correct)
This paper documents the design, procedures, competing systems, results, and conclusions
of the CADE-14 ATP System Competition (CASC-14).
1 Introduction
The CADE-14 ATP System Competition (CASC-14) w... / the prover ran in Macintosh Common LISP v . . The entrant used the br is implemented in Macintosh Common Lisp. Except for certain graphics
57.0 The POSTGRES Data Model - Rowe, Stonebraker (1987)(Correct)
The design of the POSTGRES data model is described. The data model is a relational model that has been extended with abstract data types including user-defined operators and procedures, relation attri... / different languages including C and Lisp which are the two languages being br to the rule for the new Common Lisp object model Boe It is
55.3 The effectiveness of type-based unboxing - Leroy (1997)(Correct)
We compare the efficiency of type-based unboxing
strategies with that of simpler, untyped unboxing optimizations,
building on our practical experience with
the Gallium and Objective Caml compilers. We... / and revert to uniform Lisp-style data representations where br dynamically-typed languages Lisp Smalltalk It can be used as a
54.5 Agent-Oriented Integration of Distributed Mathematical Services - Franke, Hess, al. (1999)(Correct)
Real-world applications of automated theorem proving require modern
software environments that enable modularisation, networked inter-operability, robustness,
and scalability. These requirements are... / system roughly MB of Common Lisp code for the main body in the br of their conversations are about performances of the encapsulated services.
54.3 Design Goals for ACL2 - Kaufmann, Moore (1994)(Correct)
ACL2 is a theorem proving system under development at Computational Logic, Inc., by the authors of the Boyer-Moore system, Nqthm, and its interactive enhancement, Pc-Nqthm, based on our perceptions of... / programming language Common Lisp and hence is not subject to br the logic of Nqthm is based on pure Lisp the logic of ACL is based on the
52.1 Evolving Behavioral Strategies in Predators and Prey - Haynes, Sen (1996)(Correct)
The predator/prey domain is utilized to conduct research in Distributed Artificial Intelligence. Genetic Programming is used to evolve behavioral strategies for the predator agents. To further the u... / computer programs represented as Lisp S-expressions. GPs have attracted br and more on problem solving performance on randomly generated problems
52.0 Tag-free Garbage Collection Using Explicit Type Parameters - Tolmach(Correct)
We have constructed a practical tag-free garbage collector
based on explicit type parameterization of polymorphic
functions, for a dialect of ML. The collector relies
on type information derived from ... / this technique derives from earlier Lisp implementations in which type tags br In Proc. ACM Conference on Lisp and Functional Programming June
51.5 A concurrent, generational garbage collector for a multithreaded.. - Damien Doligez (1993)(Correct)
This paper presents the design and implementation of a
"quasi real-time" garbage collector for Concurrent Caml
Light, an implementation of ML with threads. This
two-generation system combines a fast, ... / primitive similar to eq in Lisp. The provided equality primitive br collection on stock hardware. In Lisp and Functional Programming
51.4 Genetic Generation Of Both The Weights And Architecture For A Neural.. - Koza, Rice (1991)(Correct)
This paper shows how to find both the weights and architecture for a neural network (including the number of layers, the number of processing elements per layer, and the connectivity between process... / genetically breeds a population of LISP symbolic expressions br of various sizes and shapes i.e. LISP symbolic expressions Each
51.4 An Experimental Analysis of Parallel Sorting Algorithms - Blelloch, Plaxton, Leiserson, Smith (1998)(Correct)
We have developed a methodology for predicting the performance of parallel algorithms on real
parallel machines. The methodology consists of two steps. First, we characterize a machine
by enumerating ... / CM- Connection Machine CM Lisp Paris and CMIS are trademarks of br in a high level language Lisp and runs about times slower than
51.4 Kawa - Compiling Dynamic Languages to the Java VM - Bothner (1998)(Correct)
Many are interested in Java for its portable bytecodes and extensive libraries, but prefer a different language, especially for scripting. People have implemented other languages using an interpreter ... / a lexically-scoped language in the Lisp family. The Kawa dialect of Scheme br Other languages including Emacs Lisp are also being considered. Kawa
47.4 A Concurrent Copying Garbage Collector for Languages that Distinguish .. - Huelsbergen (1993)(Correct)
This paper describes the design and implementation
of a concurrent compacting garbage collector
for languages that distinguish mutable data from
immutable data (e.g., ML) as well as for languages
that... / implicit storage allocation e.g.Lisp ML Haskell is br ML. Pure functional languages Pure Lisp Haskell etc.can also be
47.4 A Graphics Toolkit Based on Differential Constraints - Gleicher (1993)(Correct)
This paper describes Bramble, a toolkit for constructing
graphical editing applications. The primary focus
of Bramble is improve support for graphical manipulation
by employing differential constraint... / manipulation. Bramble provides a LISP-like extension language and br and AutoCAD which provide LISP interpreters for extensions.
46.3 Storage Use Analysis and its Applications - Serrano, Feeley (1996)(Correct)
In this paper we present a new program analysis method
which we call Storage Use Analysis. This analysis deduces
how objects are used by the program and allows the optimization
of their allocation. Th... / is a simple language resembling Lisp functions are second class br added to the analysis. Lists in Lisp and Scheme differ from closures
46.3 Cheops: A Reconfigurable Data-Flow System for Video Processing - Bove, Jr., Watlington (1995)(Correct)
The Cheops Imaging System is a compact, modular platform for acquisition, processing, and display of digital video sequences and model-based representations of moving scenes, and is intended as both a... / here a combination of parallel LISP and C was used for programming br and present the results of some performance tests. INTRODUCTION
45.7 Modal Types as Staging Specifications for Run-Time Code Generation - Wickline (1998)(Correct)
Runtime code generation has been shown to be a powerful technique for exploiting specialization opportunities in many programs. We propose the use of sourcelevel annotations from a modal ?calculus ... / Fabius Lee and Leone and the Lisp macros. These languages allow the br decisions. The difficulty in C and Lisp on the other hand is that they
45.3 An Overview of Evolutionary Computation - Spears, De Jong, Bäck, Fogel, de.. (1993)(Correct)
Evolutionary computation uses computational models of evolution -
ary processes as key elements in the design and implementation of computerbased
problem solving systems. In this paper we provide an... / bit-strings to real-valued vectors Lisp expressions and neural networks. br such as graphs neural networks Lisp expressions ordered lists and
44.4 Cache Performance of Garbage-Collected Programs - Reinhold (1994)(Correct)
As processor speeds continue to improve relative
to main-memory access times, cache performance is becoming
an increasingly important component of program performance.
Prior work on the cache perfor... / the cache performance of four large Lisp programs running with these br a lexically-scoped dialect of Lisp that supports first-class
41.9 Skeletons from the Treecode Closet - John Salmon (1994)(Correct)
We consider treecodes (N-body programs which use a tree data structure) from the standpoint
of their worst-case behavior. That is, we derive upper bounds on the largest possible
errors that are introd... / that supports recursion e.g.C Lisp. Alternatively it is possible to br mean rms and maximum error and performance floating point operation
41.2 The nofib Benchmark Suite of Haskell Programs - Partain (1993)(Correct)
This position paper describes the need for, make-up of, and "rules of the
game" for a benchmark suite of Haskell programs. (It does not include
results from running the suite.) Those of us working on ... / are from the Gabriel suite of LISP benchmarks. They say that results br Gabriel and Masinter's paper about LISP systems The proper role of
39.7 Implementing Regular Tree Expressions - Aiken, Murphy (1991)(Correct)
Regular tree expressions are a natural formalism for describing the
sets of tree-structured values that commonly arise in programs; thus,
they are well-suited to applications in program analysis. We d... / If we interpret c as describing a Lisp cons operation and b as br the atom nil then the set of Lisp lists is fix ff c ff
38.2 Evaluation of Existing Architectures in IRAM Systems - Ngeci Bowman (1997)(Correct)
Computer memory systems are increasingly a bottleneck limiting
application performance. IRAM architectures, which integrate
a CPU with DRAM main memory on a single chip,
promise to remove this limitat... / adaptive Lempel-Ziv coding li Lisp Interpreter uses a Lisp br li Lisp Interpreter uses a Lisp interpreter to interpret a set of
37.6 VLISP: A Verified Implementation of Scheme - Guttman, Ramsdell (1995)(Correct)
The vlisp project showed how to produce a comprehensively verified implementation
for a programming language, namely Scheme. This paper introduces two more detailed studies
on vlisp 13, 21. It summa... / programming language an UnCommon Lisp is defined by the language br In ACM Symposium on Lisp and Functional Programming pages
37.1 Restructuring Fortran Programs for Cedar - Eigenmann, Hoeflinger, Jaxon, Li.. (1993)(Correct)
This paper reports on the status of the Fortran translator for the
Cedar computer at the end of March, 1991. A brief description of
the Cedar Fortran language is followed by a discussion of the fortra... / symbolic computing languages such as LISP and PROLOG as well as for C. br and Concurrent Evaluation of Lisp. Proceedings of Int'l. Conf.
37.1 Benchmarking Implementations of Lazy Functional Languages - Hartel, Langendoen (1993)(Correct)
Five implementations of different lazy functional languages
are compared using a common benchmark of a dozen
medium size programs. The benchmarking procedure has
been designed such that one set of pro... / the Yale system is embedded in a Lisp environment. Miranda br without incurring run time performance penalties that we felt
36.7 An Efficient Implementation of Self, a Dynamically-Typed.. - Chambers, Ungar, Lee (1991)(Correct)
We have developed and implemented techniques that double the performance of
dynamically-typed object-oriented languages. Our SELF implementation runs twice as fast as the
fastest Smalltalk implement... / To Be Published In Lisp And Symbolic Computation An br G.and Moon D. A. Common Lisp Object System Specification.
36.3 How to Pack Trees - Gil, Itai (1999)(Correct)
In a virtual memory system, the address space is partitioned into pages, and main
memory serves as a cache to the disk. In this setting, we address the following problem:
Given a tree, find an allocat... / application domains including AI Lisp functions and data text br which optimizes the cache performance for some access pattern to the
35.0 Evolutionary Artificial Neural Networks - Yao (1993)(Correct)
Evolutionary artificial neural networks (EANNs) [1] result from combinations of artificial
neural networks (ANNs) and evolutionary search procedures such as genetic
algorithms (GAs). This article intr... / lead to very different training performance. A typical cycle of the br an architecture. Given some performance optimality criteria e.g.
34.5 MLC++: A Machine Learning Library in C++ - Kohavi, John, Long, Manley, Pfleger (1994)(Correct)
We present MLC++ , a library of C
++
classes and
tools for supervised Machine Learning. While MLC++
provides general learning algorithms that can be used
by end users, the main objective is to prov... / learning algorithms implemented in Lisp at UCI but they are not an br researcher a broad picture of the performance of the algorithm when compared
34.2 Verifiable Semantics for Agent Communication Languages - Wooldridge (1998)(Correct)
This paper examines the issue of developing semantics for agent communication languages. In particular, it considers the problem of giving a verifiable semantics for such languages -- a semantics wher... / for messages it defines a simple LISP-like format for messages and br conditions for the successful performance of speech acts and gave a
34.2 Design and Partial Evaluation of Meta-objects for a Concurrent.. - Hidehiko Masuhara Masuhara (1998)(Correct)
In concurrent object-oriented languages, customizable meta-objects are powerful
abstraction for extending and optimizing crucial implementation mechanisms such as
method dispatch and mutual exclusio... / which is similar to the traditional Lisp meta-circular interpreter. When it br In Proceedings of Conference on LISP and Functional Programming pages
34.0 Improving Minority Class Prediction Using Case-Specific Feature.. - Cardie (1997)(Correct)
This paper addresses the problem of handling
skewed class distributions within the
case-based learning (CBL) framework. We
first present as a baseline an informationgain
-weighted CBL algorithm and ap... / task. We are using a Common Lisp implementation of C . br distributions. Although overall performance of the baseline CBL algorithm
34.0 The Extensible Java Preprocessor Kit and a Tiny Data-Parallel Java - Ichisugi, ROUDIER (1997)(Correct)
We describe the extensible Java preprocessor EPP and a data-parallel
extension of Java implemented with EPP. EPP can be extended by incorporating
EPP plugins. These plugins are programmed with the Ld-... / of tool has already been proven by Lisp implementations and has been br package implemented in Common Lisp Ste The inheritance mechanism
29.7 tcc: A System for Fast, Flexible, and High-level Dynamic Code.. - Poletto, Engler, Kaashoek (1997)(Correct)
tcc is a compiler that provides efficient and high-level access to
dynamic code generation. It implements the `C ("Tick-C") programming
language, an extension of ANSI C that supports dynamic code
gene... / Many languages such as most Lisp dialects Tcl and br . G.L. Steele Jr. Common Lisp. Digital Press second edition
29.7 Genetic Programming with User-Driven Selection: Experiments on the.. - Poli, Cagnoni (1997)(Correct)
In this paper we present an approach to
the interactive development of programs
for image enhancement with Genetic
Programming (GP) based on pseudocolour
transformations. In our approach
the user... / seminal work Sims Sims used Lisp S-expressions with several br mouse. To maintain near-realtime performance a crucial feature when the
29.6 Compiling Standard ML For Efficient Execution On Modern Machines - Shao (1994)(Correct)
Many language theoreticians have taken great efforts in designing higher-level programming
languages that are more elegant and more expressive than conventional languages. However,
few of these new la... / . . Lisp br languages such as Fortran and Lisp came into the programming world.
29.6 Viewing A Program Transformation System At Work - Paige (1994)(Correct)
How to decrease labor and improve reliability in the development of efficient implementations
of nonnumerical algorithms and labor intensive software is an increasingly important problem as
the demand... / that occur at program points and lisp-like s-expressions a general br Stream Processing ACM Symposium on LISP and Functional Programming pp.
29.0 Reflective Facilities in Smalltalk-80 - Brian Foote (1989)(Correct)
Computational reflection makes it easy to solve problems
that are otherwise difficult to address in Smalltalk-80, such
as the construction of monitors, distributed objects, and
futures, and can allow ... / aspects of itself. For example in Lisp eval permits reflecting upon br only be used when appropriate. Lisp Based Systems The Common Lisp
28.9 Simultaneous Evolution of Programs and their Control Structures - Spector (1996)(Correct)
Introduction
Modern programming languages support the production of structured, modular programs
through several mechanisms including subroutines, coroutines, and macros. Koza has previously
shown th... / and Ritchie while Common Lisp allows the full power of the br consider the following Common Lisp definition for a macro called
28.9 Scaling Effects in the CSP Phase Transition - Gent, MacIntyre, Prosser, Walsh (1995)(Correct)
Phase transitions in constraint satisfaction problems (CSP's)
are the subject of intense study. We identify a control parameter for random
binary CSP's. There is a rapid transition in the probabilit... / exactly p m conflicts. Lisp and Scheme versions of such a br directories local pat csp-lab for Lisp and local pat csp-lab.scm for
27.5 Architectures and Monitoring Techniques for Active Databases: An.. - Chakravarthy (1992)(Correct)
The need for active capability for non-traditional applications and its concomitant benefits are well-established. Although the event-based technique for monitoring conditions (leading to the integrat... / machine using Symbolics Common Lisp and flavors. This prototype was br object-oriented DBMS using Common Lisp. Section discusses the design and
27.2 Learning Situation-Specific Coordination in Cooperative Multi-agent.. - Prasad, Lesser (1999)(Correct)
Achieving effective cooperation in a multi-agent system is a difficult problem for a number of
reasons such as limited and possiblyout-dated views of activities of other agents and uncertainty
about t... / coordination may lead to better performance For example br optimize elevator dispatching performance. In both these works the
27.2 Return Value Placement And Tail Call Optimization In High Level.. - Bigot, Debray (1999)(Correct)
Machine [21], is to pass the ith argument in
register i: if the ith argument happens to be a variable (which typically corresponds
to an output argument), the value passed is a pointer to the location... / example the S- Common Lisp compiler uses this approach for br the amount of parallelism in Lisp programs by removing certain kinds
27.1 Unrolling Lists - Shao, Reppy, Appel (1994)(Correct)
Lists are ubiquitous in functional programs, thus supporting
lists efficiently is a major concern to compiler
writers for functional languages. Lists are normally represented
as linked cons cells, wit... / appear in ACM Conference on Lisp and Functional Programming br was popular on microcoded Lisp machines circa but
26.4 The Effect of Garbage Collection on Cache Performance - Zorn (1991)(Correct)
Cache performance is an important part of total performance in modern computer
systems. This paper describes the use of trace-driven simulation to estimate the effect
of garbage collection algorithms ... / Traces from four large Common Lisp programs have been collected and br effectively in languages such as Lisp Smalltalk and Prolog for many
26.3 MICROCOSM: An Open Model for Hypermedia With Dynamic Linking - Fountain, Hall, Heath, al. (1990)(Correct)
There are currently a number of commercially available hypertext and hypermedia systems, of varying levels of sophistication and usability, but there are still many problems to be resolved in the desi... / ways of programming based around Lisp and the recently de ned Haskell br Advances in computer power and performance have permitted the visionary
26.0 A Study in Program Response and the Negative Effects of Introns in.. - Andre, Teller (1996)(Correct)
The standard method of obtaining a
response in tree-based genetic programming
is to take the value returned by the
root node. In non-tree representations,
alternate methods have been explored.
One alt... / by the functional programming of LISP. The most common way to get a br can seriously degrade the search performance of genetic programming.
25.8 Analysis of Recursive Types in Lisp-like Languages - Wang, Hilfinger (1992)(Correct)
We introduce a new algorithm to analyze recursive,
structured types. It derives information from object
uses (accesser functions with type checking), as well as
from object allocation. The type descri... / Analysis of Recursive Types in Lisp-like Languages Edward Wang Paul br containing pointers typified by Lisp programs that manipulate
25.5 Numerical Methods for Model-Based Pose Recovery - Carceroni, Brown (1997)(Correct)
In this paper we review and compare several techniques for model--based pose recovery (extrinsic
camera calibration) from monocular images. We classify the solutions reported in
the literature as anal... / off-line which is a major performance drawback with respect to the br in a significant inner-loop performance gain with respect to the fully
25.5 Multiagent Mission Specification and Execution - MacKenzie, Arkin (1997)(Correct)
Specifying a reactive behavioral configuration for use by a multiagent team requires both a careful
choice of the behavior set and the creation of a temporal chain of behaviors which executes the m... / and teleoperate. SAUSAGES is a Lisp-based script language tailored for br The code generator now emits LISPbased SAUSAGES code suitable for
24.7 FLEX: A Tool for Building Efficient and Flexible Systems - Carter, Ford, Hibler, Kuramkote.. (1993)(Correct)
Modern operating systems must support a wide variety of services for a diverse set of users. Designers
of these systems face a tradeoff between functionality and performance. Systems like Mach provide... / definition modules. FLEX uses a Lisp-like module manipulation language br between functionality and performance. Systems like Mach provide a
24.1 Multi-Garnet: Integrating Multi-Way Constraints with Garnet - Michael Sannella (1992)(Correct)
Constraints provide a useful mechanism for maintaining relations in user interface toolkits. Garnet
is a widely-used user interface toolkit with considerable functionality, based on one-way, required
... / interface toolkit built on Common Lisp and X windows with considerable br version . and Allegro Common Lisp version . . running on a SUN
23.1 Cooperative - Competitive Genetic Evolution of Radial Basis Function.. - Whitehead, Choate (1995)(Correct)
In a radial basis function (RBF) network, the
RBF centers and widths can be evolved by a cooperativecompetitive
genetic algorithm. The set of genetic strings
in one generation of the algorithm represe... / prediction and generalization performance This problem is most br individual networks based on the performance of each network. Within this
23.1 The Basis for Mediation - Wiederhold, Genesereth (1995)(Correct)
Mediator modules provide intermediary services in information systems, linking data resources and
application programs. Programs that led to the concept of mediation were either constructed to
support... / programmed in languages as lisp. If optimization is crucial to br are only partially related to performance. Having identifiable and
23.1 Genetic Programming for Articulated Figure Motion - Gritz, Hahn (1995)(Correct)
this paper. When a GP run has finished, the final output of the GP subsystem is a single controller program. This controller program is the one which, when used to govern the actions of a simulated ag... / parse trees can be represented by LISP S-expressions Figure shows br . Steele G. Common Lisp The Language. Digital Press
22.8 Using Caching to Solve Larger Probabilistic Planning Problems - Stephen Majercik (1998)(Correct)
Probabilistic planning algorithms seek effective plans
for large, stochastic domains. maxplan is a recently
developed algorithm that converts a planning problem
into an E-Majsat problem, an NP
PP
-c... / maxplan's conversion unit is a LISP program that takes a planning br this problem without significant performance degradation. The first
22.6 A Debugger for Standard ML - Tolmach, Appel (1993)(Correct)
We have built a portable, instrumentation-based, replay debugger for the Standard ML of
New Jersey compiler. Traditional "source-level" debuggers for compiled languages actually
operate at machine lev... / of the ACM Conference on Lisp and Functional Programming Nice br cost in added execution time. Many Lisp systems have powerful and elaborate
22.2 Multiplication of Matrices of Arbitrary Shape on a Data Parallel.. - Kapil Mathur (1994)(Correct)
Some level--2 and level--3 Distributed Basic Linear Algebra Subroutines (DBLAS) that
have been implemented on the Connection Machine system CM--200 are described. For
matrix--matrix multiplication, bo... / a level- DBLAS yields better performance than a level- DBLAS. On the br CM- blocking yields a performance improvement by a factor of up
22.2 Integrating Intelligent Systems into a Cooperating Community for.. - Szl Varga (1994)(Correct)
Systems in which semi-autonomous problem solving agents communicate and cooperate with
one another represent an exciting vision of future computing environments. However, if this
vision is ever goin... / languages will be used e.g. LISP Prolog C FORTRAN and Informix br and efficient manner the performance of both the individuals and the
21.5 Bypassing the Intractable Problem of Student Modelling - Self (1990)(Correct)
This paper attempts to rehabilitate student models within intelligent tutoring
systems. Recently, some researchers have questioned both the need for detailed student
models and the practical possibili... / if we ensure that p as in the Lisp tutor Anderson and Reiser br domains such as subtraction and Lisp programming and even there there
21.0 Extending a Data Base System with Procedures - Stonebraker, Anton, Hanson(Correct)
This paper suggests that more powerful data base systems (DBMS) can be built by supporting
data base procedures as full fledged data base objects. In particular, allowing fields of a data
base to be a... / during command execution. Moreover Lisp WILE supports objects which br . wile Wilensky R.the Lisp Primer W. Norton Co New York
20.6 Main Memory Oriented Optimization of OO Queries using Typed Datalog.. - Litwin, Risch (1992)(Correct)
Object-oriented DBMSs (OODBs) have created a demand for relationally
complete, extensible, and declarative object-oriented (OO)
query languages. Until now, run time performance of such languages
was f... / log rolled forward. Alt. LISP or IPL array. The resolvent br Foreign pred- C Lisp or IPL icates implement
20.6 Screamer: A Portable Efficient Implementation of Nondeterministic.. - Siskind, McAllester (1993)(Correct)
Nondeterministic Lisp is a simple extension of Lisp which provides automatic
backtracking. Nondeterminism allows concise description of many search tasks which
form the basis of much AI research. This... / of Nondeterministic Common Lisp Jeffrey Mark Siskind br Abstract Nondeterministic Lisp is a simple extension of Lisp
20.2 Supporting the Construction and Evolution of Component Repositories - Henninger (1996)(Correct)
Repositories must be designed to meet the evolving and
dynamic needs of software development organizations.
Current software repository methods rely heavily on
classification, which exacerbates acquis... / PEEL Parse and Extract Emacs Lisp extracts components from text br investigated in the domain of Emacs Lisp customizations for the GNU Emacs
20.0 Garbage Collection for Strongly-Typed Languages using Run-time Type.. - Aditya, Flood, Hicks(Correct)
Garbage collectors perform two functions: live-object detection
and dead-object reclamation. In this paper, we present
a new technique for live-object detection based on run-time
type reconstruction ... / Proceedings of the ACM Conference on Lisp and Functional Programming br languages such as CCommon Lisp SML and Haskell that support the
19.7 Synthesis of Sigma-Pi Neural Networks by the Breeder Genetic.. - Zhang, Mühlenbein (1994)(Correct)
Genetic programming has been successfully applied
to evolve computer programs for solving a variety of
interesting problems. In the previous work we introduced
the breeder genetic programming (BGP) me... / are expressed as parse trees or LISP S-expressions. Fitness br only improves the generalization performance it can also accelerate the
18.5 Generational garbage collection for Haskell - Sansom, Jones (1993)(Correct)
This paper examines the use of generational garbage collection
techniques for a lazy implementation of a non-strict
functional language. Detailed measurements which demonstrate
that a generational gar... / of call-by-value languages such as Lisp Clark Green Zorn br of bottom up as they would be in Lisp updates are very frequent and
18.5 Hash-consing Garbage Collection - Appel, Gonçalves (1993)(Correct)
We describe an implementation of hash-consing for the Standard ML
of New Jersey compiler. Hash-consing can eliminate replication among
heap-allocated data, which may allow the use of fast equality che... / languages such as ML and Lisp values are represented by br use of equal instead of eq in Lisp Moreover the duplication of
18.5 Polling Efficiently on Stock Hardware - Marc Feeley (1993)(Correct)
Two strategies for supporting asynchronous interrupts are:
the use of the processor's hardware interrupt system and the
use of polling. The advantages of polling include: portability,
simplicity, and ... / at the issues in the context of a Lisp system because Lisp stresses many br the context of a Lisp system because Lisp stresses many problems e.g.
18.5 Simultaneous Discovery of Reusable Detectors and Subroutines Using.. - John Koza (1993)(Correct)
This paper describes an approach for
automatically decomposing a problem into
subproblems and then automatically discovering
reusable subroutines, and a way of assembling
the results produced by these... / if the programmer were using the LISP programming language he might br definition called a defun in LISP does four things. First it
18.1 Efficient Implementation of Unification-Based Grammars - Wintner, Francez (1999)(Correct)
Contemporary linguistic formalisms such as LFG or HPSG have become so rigorous that it is now
possible to view them as very high level declarative programming languages. Consequently, grammars
for na... / LFG which translates the grammar to Lisp or Profit which compiles br results in a much improved performance over existing systems.
18.1 Opus: Heterogeneous Computing With Data Parallel Tasks - Laure, Mehrotra, Zima (1999)(Correct)
The coordination language Opus is an object-based extension of High Performance Fortran (HPF)
that supports the integration of coarse-grain task parallelism with HPF-style data parallelism. In this
pa... / of shared data types SDTs in a Lisp-like syntax. The description of an br an object-based extension of High Performance Fortran HPF that supports
18.0 The Evolution of Strategies for Multi-agent Environments - Grefenstette (1987)(Correct)
SAMUEL is an experimental learning system that uses genetic algorithms and other learning
methods to evolve reactive decision rules from simulations of multi-agent environments. The
basic approach is ... / uses genetic algorithms to evolve LISP expressions as decision rules. In br the agent model is essentially a LISP interpreter. We have explored a
17.3 NLG vs. Templates - Reiter (1995)(Correct)
One of the most important questions in applied NLG is what benefits (or `valueadded
', in business-speak) NLG technology offers over template-based approaches.
Despite the importance of this question ... / in a programming language such as Lisp or Cor it can be specified via br of is the P construct in the Lisp format function which will do
17.3 DFKI Oz User's Manual - Mehl, Müller, Popov, Scheidhauer (1995)(Correct)
DFKI Oz is an interactive implementation of Oz, a high-level programming language
designed for concurrent symbolic computation. DFKI Oz features a programming
interface based on GNU Emacs, a concurren... / with commercial Prolog and Lisp systems. DFKI Oz is available for br for stand-alone applications. Performance is competitive with commercial
17.2 A Uniform Computational Model for Natural Language Parsing and.. - Neumann (1994)(Correct)
this paper is that neither has been implemented." ( [ Vaughan
and McDonald, 1986 ] , page 95). Although Meteer [ 1990 ] gives a detail description of
the relationship between text structure and revisi... / Methode sind vollstandig in Common Lisp implementiert und wurden mit br been fully implemented in Common Lisp and tested with several small
17.2 Interoperation, Mediation, and Ontologies - Gio Wiederhold (1994)(Correct)
In this paper we address the problem of interoperation at a semantic level. We
assume that emerging standards will solve most of the syntactic infrastructure
problems that exist today. However, intero... / programmed in languages as lisp. If optimization is crucial to br in the network including high-performance computers. The implementation
17.2 Genetic Programming with Adaptive Representations - Rosca, Ballard (1994)(Correct)
Machine learning aims towards the acquisition of knowledge based on either experience from
the interaction with the external environment or by analyzing the internal problem-solving
traces. Both appro... / the tree in figure represents a LISP program implementing a boolean br Each component is a piece of lisp code built out of specific
17.2 Dynamic Dispatch in Object-Oriented Languages - Milton, Schmidt (1994)(Correct)
Dynamic binding in object-oriented languages is perhaps the most important semantic
aspect of these languages. At the same time it can contribute to inefficiency and lack of
robustness because it incu... / proper function. Systems like the Lisp-machine operating system with about br The Common Lisp Object System CLOS supports many
17.1 On the Runtime Complexity of Type-Directed Unboxing - Minamide (1998)(Correct)
Avoiding boxing when representing native objects is essential for the efficient compilation of any programming language. For polymorphic languages this task is difficult, but several schemes have been... / In dynamically typed languages like Lisp the basic approach to data br In Proc. ACM Conference on Lisp and Functional Programming pages
17.1 Memory Management during Run Generation in External Sorting - Larson, Graefe (1998)(Correct)
If replacement selection is used in an external mergesort to
generate initial runs, individual records are deleted and in-
serted in the sort operation's workspace. Variable-length
records introduce ... / for a programming language such as Lisp or Java. On one hand the size of br algorithms. Given the excellent performance of the best-fit algorithm we
17.0 A Reflective Architecture for Real-Time Operating Systems - Stankovic, Ramamritham (1997)(Correct)
Introduction
In the field of complex real-time systems, it is a common understanding that we
want integrated system-wide solutions so that design, implementation, testing,
monitoring, dependability, ... / code at run time similar to how LISP has a duality between code and br capable of providing predictable performance with respect to timing
17.0 Integrating data-parallel and reactive constructs into Java - Roudier, Ichisugi (1997)(Correct)
We introduce the EPP extensible preprocessor and explain
how it permits to integrate new constructs into the Java language in a modular
way. We present experiments of data-parallel frameworks and re... / language implemented in Common Lisp Ste The usual inheritance br of tool has already been proven by Lisps and adapted to Cby various
17.0 Java's Role in Distributed Collaboration - Marina Chen (1997)(Correct)
In this white paper, we sketch some techniques for using Java to improve the state-of-theart
in scalable collaboration management for scientific and engineering applications. We
argue that flexibility... / machine cycles are sinful. The LISP machine now permits LISP br sinful. The LISP machine now permits LISP programmers to abandon bra and
16.4 List Processing Primitives for Parallel Computation - Axford, Joy (1993)(Correct)
A new model of list processing is proposed which is more suitable as a basic data
structure for architecture-independent programming languages than the traditional model
of lists. Its main primitive f... / and successful formulation was in Lisp with its primitive functions br tail and cons respectively. Lisp and its model of list processing
16.1 The Polylith Software Bus - James Purtilo (1991)(Correct)
We describe a system called Polylith that helps programmers prepare and interconnect mixed-language
software components for execution in heterogeneous environments. Polylith's principal benefit is tha... / have been implemented by either the Lisp code shown in Figure or the Ada br for interactive languages such as Lisp the language environment also
16.0 Signatures for a Network Protocol Stack: A Systems Application of.. - Edoardo Biagioni(Correct)
Advanced programming languages such as Standard ML
have rarely been used for systems programming tasks such as
operating systems and network communications. In order to
understand more fully the requi... / F - -C- . To appear in Lisp and Functional Programming June br careful design to achieve high performance and reliability. An efficient
15.5 Barrier Methods for Garbage Collection - Zorn (1990)(Correct)
Garbage collection algorithms have been enhanced in recent years with two methods:
generation-based collection and Baker incremental copying collection. Generationbased
collection requires special act... / reclamation that has been used in Lisp runtime systems for many years. br data published about the behavior of Lisp systems and even fewer
15.5 Hardware speedups in long integer multiplication - Shand, Bertin, Vuillemin (1990)(Correct)
We present various experiments in Hardware/Software design tradeoffs
met in speeding up long integer multiplications. This work
spans over a year, with more than 12 different hardware designs
tested a... / units and coprocessors to accelerate lisp computations. . Limits to br High level languages such as C Lisp Modula CRussel Caml
15.5 Softbots as Testbeds for Machine Learning - Etzioni (1992)(Correct)
If you want to think about thinking, you
have to think about thinking about something."
--- Seymour Papert
A softbot (software robot) is a program that
interacts with a software environment by issui... / copying itself and starting a Lisp process on the remote machine. . br objects e.g. location of the Lisp executable and the preferences of
15.5 Incremental Collection of Mature Objects - Richard Hudson (1992)(Correct)
We present a garbage collection algorithm that extends generational scavenging
to collect large older generations (mature objects) non-disruptively. The algorithm
's approach is to process bounded-s... / performance. Moon also relied on the Lisp machine hardware to provide a read br of mutator cooperation needed. The Lisp Machine Weinreb and Moon
14.8 Analysis of Recursive Types in an Imperative Language - Wang (1994)(Correct)
Analysis of Recursive Types in an Imperative Language
by
Edward Yan-Bing Wang
Doctor of Philosophy in Computer Science
University of California at BERKELEY
Professor Paul N. Hilfinger, Chair
I introdu... / and object use. When applied to Lisp and used to discover unnecessary br . Types and Type Analysis in Lisp
14.8 Fast Prolog with an Extended General Purpose Architecture - Holmer, Sano, Carlton, Van Roy.. (1994)(Correct)
Most Prolog machines have been based on specialized
architectures. Our goal is to start with a general purpose
architecture and determine a minimal set of extensions
for high performance Prolog execut... / is a common technique used by Lisp implementations on general purpose br Hennessy. Tags and type checking in LISP Hardware and software approaches.
14.8 The Development of the Image Understanding Environment - Charles Kohl (1994)(Correct)
The Image Understanding Environment (IUE) project is a five year program, sponsored by ARPA, to
develop a common object-oriented software environment for the development of algorithms and application
... / IU research and support both C and Lisp application development. To design br of the Cobject code into a Lisp CLOS environment. The IUE
14.4 Efficient and Language-Independent Mobile Programs - Adl-Tabatabai, Langdale, Lucco, Wahbe (1996)(Correct)
This paper evaluates the design and implementation of Omniware:
a safe, efficient, and language-independent system for
executing mobile program modules. Previous approaches to
implementing mobile code... / such as C CPascal Common Lisp and Fortran. In the software br mobile code system sacrifices performance to gain safety through abstract
14.4 Reflection on a Legacy Transaction Processing Monitor - Barga, Pu (1996)(Correct)
In this paper we describe our experience applying the concepts of reflection to a legacy
transaction processing (TP) monitor in order to support the implementation of extended
transaction models. In t... / systems such as CLOS BGW and -LISP dRS the Reflective br Smith. Reflection and Semantics in Lisp. In Proceedings of the th Annual
14.4 Strategy-Accurate Parallel Buchberger Algorithms - Attardi, Traverso (1996)(Correct)
this paper we describe two parallel formulations of Buchberger algorithm, one for
y unknown J. Symbolic Computation (1996) 22, 1--15
Strategy-Accurate Parallel Buchberger Algorithms
GIUSEPPE ATTARDI
... / in ECoLisp an embeddable Common Lisp which can be linked with C based br should be considered since the Lisp implementation is inherently
14.2 Software Architecture for Language Engineering - Cunningham (2000)(Correct)
This thesis defines the boundaries of Software Architecture for Language Engineering
(SALE), an area formed by the intersection of human language computation and software
engineering. SALE covers all ... / the current set includes Prolog Lisp and Perl programs for example br Microsoft Word macros from Emacs LISP and as a Web browser plugin
13.7 Nreversal Of Fortune - The Thermodynamics of Garbage Collection - Baker (1992)(Correct)
The need to reverse a computation arises in many contexts---debugging, editor undoing, optimistic concurrency
undoing, speculative computation undoing, trace scheduling, exception handling undoing, da... / and a programming language-Y-Lisp-whose primitive operations are br have one state for all times Y-Lisp has at all times one state with
12.7 Parallel Genetic Programming and its application to trading model.. - Oussaidene, Chopard, Pictet.. (1997)(Correct)
This paper presents a scalable parallel implementation of genetic programming
on distributed memory machines. The system runs multiple
master-slave instances each mapped on all the allocated nodes and... / GP traditionally using the Lisp syntax. Genetic programming is now br programs A GP can be regarded as a Lisp function or S-expression. It is
12.3 Combining Genetic Algorithms and Neural Networks: The Encoding Problem - Koehn (1994)(Correct)
Neural networks and genetic algorithms demonstrate powerful problem
solving ability. They are based on quite simple principles, but take advantage
of their mathematical nature: non-linear iteration.
N... / D Tree Representation LISP S-Expression D D . br are evaluated according to their performance on academic and practical
12.3 A "Linear Logic" Quicksort - Baker (1994)(Correct)
INTRODUCTION
Linear logic [Girard87] [Lafont88] [Abramsky93] has been proposed as the basis for a "linear" computer language
which preserves the cleanliness of functional programming, yet allows effi... / arrays in a linear fragment of Lisp to estimate the performance impact br in a linear fragment of Common Lisp and-contrary to the conclusions
12.3 A Calculus for Exploiting Data Parallelism on Recursively Defined Data - Nishimura, Ohori (1994)(Correct)
Array based data parallel programming can be generalized
in two ways to make it an appropriate paradigm for parallel processing
of general recursively defined data. The first is the introduction of ... / Dataparallel C HQ Lisp Las and High Performance br including Connection Machine Lisp WS Paralation Lisp Sab
12.3 Supporting the Learning of Recursive Problem Solving - Bhuiyan, Greer, McCalla (1994)(Correct)
This research is about the problem solving activities of novice programmers as they
learn to create recursive LISP programs. Their problem solving not only includes the issue of
mental models, but a... / as they learn to create recursive LISP programs. Their problem solving not br and another group used a standard LISP environment as they learned
12.3 A strategy-accurate parallel Buchberger algorithm - Attardi, Traverso (1994)(Correct)
We describe a parallelized form of Buchberger algorithm that is strategy-accurate,
i.e. that exactly simulates the sequential algorithm. The algorithm has been experimentally
implemented on a a netw... / on ECoLisp an embeddable Common Lisp which can be linked with C based br implemented in Common Lisp using ECoLisp. The protocol
12.3 TDL - A Type Description Language for Constraint-Based Grammars - Krieger, Schäfer (1994)(Correct)
This paper presents TDL, a typed feature-based representation
language and inference system. Type definitions
in TDL consist of type and feature constraints over
the boolean connectives. TDL supports ... / available by the underlying Common Lisp system and atoms. Recursive br by the unifier and the underlying Lisp system. The kernel of TDL and
12.3 Using Multilisp for Solving Constraint Satisfaction Problems: an.. - Marc Feeley (1994)(Correct)
This paper describes and evaluates a parallel program for determining the threedimensional
structure of nucleic acids. A parallel constraint satisfaction algorithm is used to
search a discrete space... / Lisp And Symbolic Computation br of the ACM Conference on Lisp and Functional Programming