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
530.4 The Oz Programming Model - Smolka (1995)(Correct)
The Oz Programming Model (OPM) is a concurrent programming model subsuming higher- order functional and object-oriented programming as facets of a general model. This is particularly interesting for c... / high-level languages such as Lisp Prolog and Smalltalk. There is no br The Oz Programming Model Gert Smolka
418.1 Model Checking Java Programs Using Java PathFinder - Havelund, Pressburger (1999)(Correct)
This paper describes a translator called Java
PathFinder from Java to Promela, the "programming
language" of the Spin model checker. The purpose
is to establish a framework for verification and debu... / operating system programmed in Lisp for the Deep-Space space br a multi-threaded version of Common Lisp. The verification effort
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
363.7 Comprehending Monads - Wadler (1992)(Correct)
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certa... / appeared in ACM Conference on Lisp and Functional Programming Nice br programming. In ACM Conference on Lisp and Functional Programming pp.
354.2 Classes and Mixins - Flatt, Krishnamurthi, Felleisen (1998)(Correct)
While class-based object-oriented programming languages
provide a flexible mechanism for re-using and managing related
pieces of code, they typically lack linguistic facilities
for specifying a unifor... / of class-to-class functions. Common Lisp programmers refer to this protocol br keyword arguments a la Common Lisp are a symptom of this problem not
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
331.4 Revised^5 Report on the Algorithmic Language Scheme - Kelsey, (ed.), Clinger, (ed.), Rees, .. (1998)(Correct)
Programming languages should be designed not by piling feature on top of feature, but by removing the weaknesses and restrictions that make additional features appear necessary. Scheme demonstrates th... / tail-recursive dialect of the Lisp programming language invented by br was the first major dialect of Lisp to distinguish procedures from
327.9 Revised^4 Report on the Algorithmic Language Scheme - Clinger, (ed.), Rees, (ed.).. (1991)(Correct)
Programming languages should be designed not by piling feature on top of feature, but by removing the weaknesses and restrictions that make additional features appear necessary. Scheme demonstrates th... / tail-recursive dialect of the Lisp programming language invented by br was the first major dialect of Lisp to distinguish procedures from
313.0 Compiling Polymorphism Using Intensional Type Analysis - Harper, Morrisett (1995)(Correct)
Types have been used to describe the size and shape of data structures at compile time. In polymorphic languages or languages with abstract types, this is not possible since the types of some objects ... / Early implementations used a LISP-like representation in which all br Mini-ML. In ACM Conference on LISP and Functional Programming .
285.7 Dependent Types in Practical Programming - Xi (1998)(Correct)
Programming is a notoriously error-prone process, and a great deal of evidence in practice has demonstrated that the use of a type system in a programming language can effectively detect program error... / untyped programming language Common Lisp and thus strongly motivated my br applies CDR to an atom in LISP and finds himself absurdly adding a
285.1 The Architecture of the Ara Platform for Mobile Agents - Peine, Stolpmann (1997)(Correct)
We describe a platform for the portable and secure execution of mobile agents written in various interpreted languages on top of a common run-time core. Agents may migrate at any point in their execut... / other languages such as Pascal and Lisp are being considered. The br to the well-developed world of programming rather than attempt to build a
269.1 Specification of the KQML Agent-Communication Language - Finin, Weber, Wiederhold.. (1994)(Correct)
this document send a message to kqml-users@isi.edu) Tim Finin (co-chair) University of Maryland Jay Weber (co-chair) Enterprise Integration Technologies Gio Wiederhold (former co-chair) Stanford Unive... / Syntaxes C. The ABSE Lisp API br were written in combinations of LISP Prolog and Cthey run on a
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
263.2 A Logic Programming Language with Lambda-Abstraction, Function.. - Miller (1991)(Correct)
ion, Function Variables, and Simple Unification Dale Miller Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104--6389 USA Abstract: It has been argued else... / to represent first-order formulas in Lisp it is a more complex matter to br it is a more complex matter to write Lisp programs that correctly substitute
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
255.8 Revised^3 Report on the Algorithmic Language Scheme - Rees, (ed.), Clinger, (ed.).. (1991)(Correct)
Programming languages should be designed not by piling feature on top of feature, but by removing the weaknesses and restrictions that make additional features appear necessary. Scheme demonstrates th... / tail-recursive dialect of the Lisp programming language invented by br has influenced the evolution of Lisp. Scheme was one of the first
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
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
228.5 Building Natural Language Generation Systems - Reiter, Dale (2000)(Correct)
This book explains how to build Natural Language Generation (NLG) systems - computer software systems which use techniques from artificial intelligence and computational linguistics to automatically g... / standard programming language CLisp etc The resultant system may br in a standard programming language CLisp etc The
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 (... / ES evolutionary programming EP and genetic br Steerable genNets the genetic programming of steerable behaviors in
214.4 Programming Parallel Algorithms - Blelloch (1996)(Correct)
In the past 20 years there have been a huge number of algorithms designed for parallel computers, most which have been designed for one of the variants of the Parallel Random Access Machine (PRAM) mod... / an interactive environment has a Lisp-like syntax and allows br not however be confused with Lisp or Scheme. In fact we are
204.1 Strongly Typed Genetic Programming - Montana (1993)(Correct)
Genetic programming is a powerful method for automatically generating computer programs via the
process of natural selection [Koza 92]. However, it has the limitation known as "closure", i.e. that all... / C PASCAL and Ada in the language LISP a subroutine essentially is its br to downplay the association with LISP and have implemented our genetic
187.9 Implementing lazy functional languages on stock hardware: the.. - Jones (1992)(Correct)
The Spineless Tagless G-machine is an abstract machine designed to support nonstrict higher-order functional languages. This presentation of the machine falls into three parts. Firstly, we give a gene... / Turner and say a Lisp compiler is substantial. So great br similar code to those for say Lisp. In this section we attempt to
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 in Genetic Programming Lee Altenberg
184.4 Mixin-based Inheritance - Bracha, Cook (1990)(Correct)
The diverse inheritance mechanisms provided by
Smalltalk, Beta, and CLOS are interpreted as different
uses of a single underlying construct. Smalltalk and
Beta differ primarily in the direction of cla... / using inner. In the Common Lisp Object System CLOS and its br L.and Gabriel R. The Common Lisp Object System An overview. In
182.8 OKBC: A Programmatic Foundation for Knowledge Base Interoperability - Chaudhri, Farquhar (1998)(Correct)
The technology for building large knowledge bases (KBs) is yet to witness a breakthrough so that a KB can be constructed by the assembly of prefabricated knowledge components. Knowledge components inc... / OKBC implementations in Lisp C and Java may be obtained from br implementations for OKBC exist for Lisp C and Java. To improve e ciency
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
179.7 A Calculus for Overloaded Functions with Subtyping - Castagna, Ghelli, Longo (1995)(Correct)
We present a simple extension of typed -calculus where functions can be overloaded
by putting different "branches of code" together. When the function is
applied, the branch to execute is chosen acco... / of the ACM Conference on LISP and Functional Programming San br DeMichiel and R.P. Gabriel. Common lisp object system overview. In
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 distributed computing programming environments system modelling
165.9 Analysis of Complexity Drift in Genetic Programming - Rosca (1997)(Correct)
One serious problem of standard Genetic
Programming (GP) is that evolved structures
appear to drift towards large and slow
forms on average. This paper presents a
novel analysis of the role played by ... / trees. A schema is a set of LISP S-expressions sharing common br of Complexity Drift in Genetic Programming Justinian P. Rosca
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.
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 the ACMSIGPLAN ' Conference on Programming Language Design and
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
142.0 List Processing in Real Time on a Serial Computer - Baker, Jr. (1978)(Correct)
ing with credit is permitted. To copy otherwise, to republish, to
post on servers, to redistribute to lists, or to use any component of this
work in other works whether directly or by incorporation vi... / RPLACA RPLACD EQ and ATOM in LISP is bounded by a small constant. br management storage allocation LISP CDR-coding reference counting.
136.3 Region Analysis and the Polymorphic Lambda Calculus - Anindya Banerjee (1999)(Correct)
We show how to translate the region calculus of Tofte and Talpin, a typed lambda calculus which can statically delimit
the lifetimes of objects, into an extension of the polymorphic lambda calculus ca... / programming language e.g.C CLISP ML Haskell Smalltalk or Java br of the ACM Conference on Lisp and Functional Programming pages
134.0 Efficient Flow-Sensitive Interprocedural Computation of.. - Choi, Burke, Carini (1993)(Correct)
We present practical approximation methods for
computing interprocedural aliases and side effects
for a program written in a language that includes
pointers, reference parameters and recursion. We
pre... / due to pointers in languages like LISP C Cor Fortran and br and side effects for languages like LISP C Cand Fortran which
133.3 Simple Imperative Polymorphism - Wright (1995)(Correct)
This paper describes a simple extension of the Hindley-Milner polymorphic type discipline to call-by-value languages that incorporate imperative features like references, exceptions, and continuatio... / Continuations functional programming polymorphism references br type system for functional programming languages. Many call-by-value
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
129.3 Artificial Life and Real Robots - Brooks (1992)(Correct)
The first part of this paper explores the general issues in using Artificial Life techniques to program actual mobile robots. In particular it explores the difficulties inherent in transferring progra... / genetic algorithms directly to lisp-like programs rather than to more br interest in the idea of mutating lisp program structures directly Lenat
127.5 Programming Constructs for Unstructured Data - Buneman, Davidson, Suciu (1995)(Correct)
We investigate languages for querying and transforming unstructured data by which we mean languages than can be used without knowledge of the structure (schema) of the database. There are two reasons ... / with the dynamic type system of Lisp whose one basic data structure br such as doc article using the lisp notation for quoting the quote
126.4 A Scheme for Integrating Concrete Domains into Concept Languages - Baader, Hanschke (1991)(Correct)
A drawback which concept languages based on kl-one have is that all the terminological
knowledge has to be defined on an abstract logical level. In many applications,
one would like to be able to refe... / numbers strings and .arbitrary Lisp objects Mays et al. br .For similar reasons Logic Programming has been extended to Constraint
125.7 Java light is Type-Safe - Definitely - Nipkow, von Oheimb (1998)(Correct)
Java `ight is a large sequential sublanguage of Java. We
formalize its abstract syntax, type system, well-formedness
conditions, and an operational evaluation semantics. Based
on this formalization, w... / by writing an interpreter in Common Lisp. He used ACL the latest version br the design of non-trivial programming languages has become a
123.4 A Type-Based Compiler for Standard ML - Zhong Shao (1994)(Correct)
Compile-time type information should be valuable in
efficient compilation of statically typed functional languages
such as Standard ML. But how should typedirected
compilation work in real compilers, ... / run-time type checking such as Lisp and Smalltalk must often use br dynamically typed languages e.g.Lisp that is to represent all program
118.5 Neural Network Synthesis Using Cellular Encoding And The Genetic.. - Frédéric Gruau (1994)(Correct)
Artificial neural networks used to be considered only as a machine that learns using small
modifications of internal parameters. Now this is changing. Such learning method do not allow
to generate big... / . Cellular Encoding Versus LISP br used Genetic Algorithms to evolve LISP programs. LISP is a language for
116.0 Building Interpreters by Composing Monads - Steele, Jr. (1994)(Correct)
We exhibit a set of functions coded in
Haskell that can be used as building blocks to construct
a variety of interpreters for Lisp-like languages. The
building blocks are joined merely through funct... / a variety of interpreters for Lisp-like languages. The building br to switch to Scheme or Common Lisp. Had I used a dialect of Lisp it
116.0 CENTAUR: the system - Borras, Clément, Despeyrouz.. (1988)(Correct)
syntax terms occur in most rules. They
have to be valid terms w.r.t. their abstract syntax.
Every such term is typed with a syntatic category.
The type-checking phase of TYPOL compilation uses
this in... / CENTAUR is essentially written in Lisp Le Lisp The logical engine is br is essentially written in Lisp Le Lisp The logical engine is Prolog
111.0 Reasoning about Programs in Continuation-Passing Style - Sabry(Correct)
Plotkin's -value calculus is sound but incomplete for reasoning about fij-transfor- mations on programs in continuation-passing style (CPS). To find a complete extension, we define a new, compactifyin... / version of this paper appeared in Lisp and Functional Programming June br j v is unsound in languages like Lisp or Scheme as argued in Section .
110.1 Orthogonally Persistent Object Systems - Atkinson, Morrison (1995)(Correct)
Persistent Application Systems (PASs) are of increasing social and economic importance. They have the potential to be long-lived, concurrently accessed and consist of large bodies of data and programs... / Dynamic scoping can be seen in Lisp McCarthy et al. the br appears in the eval functions of Lisp McCarthy et al. and
106.1 A Practical Soft Type System for Scheme - Wright, Cartwright (1994)(Correct)
Soft typing is a generalization of static type checking that accommodates both dynamic typing and static typing in one framework. A soft type checker infers types for identifiers and inserts explicit ... / appear in the ACM Conference on Lisp and Functional Programming. But br Scheme a modern dialect of Lisp. Soft Scheme is based on an
104.0 Recursive Functions of Symbolic Expressions and Their Computation by.. - McCarthy (1960)(Correct)
this paper in L unknown Recursive Functions of Symbolic Expressions
and Their Computation by Machine, Part I
John McCarthy, Massachusetts Institute of Technology, Cambridge, Mass.
April 1960
1 / A programming system called LISP for LISt Processor has been br In the course of its development the LISP system went through several stages
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.5 Constraint Hierarchies - Borning, Feldman-Benson, Wilson (1992)(Correct)
Constraints allow programmers and users to state declaratively a relation
that should be maintained, rather than requiring them to write procedures to maintain
the relation themselves. They are thus... / Lisp And Symbolic Computation An br C CObject Pascal and Common Lisp. All of these implementations
91.4 A Type-Theoretic Interpretation of Standard ML - Harper, Stone (1998)(Correct)
ion boundaries must be broken at run-time. Consequently, an association between
the abstract stamps and their underlying representations must be maintained.
In this paper we outline an interpretation ... / language and Scheme a dialect of Lisp could be interpreted into an br ML. In ACM Symposium on LISP and Functional Programming pages
90.9 Multi-Stage Programming: Its Theory and Applications - Taha (1999)(Correct)
MetaML is a statically typed functional programming language with special support for program generation. In addition to providing the standard features of contemporary programming languages such as S... / revisiting Quine's original work and LISP's back-quote and comma mechanism. br with use of back-quote and comma in LISP ever since they were introduced
90.9 Modular Statically Typed Multimethods - Todd Millstein (1999)(Correct)
Multimethods offer several well-known advantages over the single dispatching of conventional object-oriented
languages, including a simple solution to the "binary method" problem and a form of "open o... / with multimethods such as Common Lisp Dylan and Cecil the appropriate br positions as is done in Common Lisp Steele Paepcke then the
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... /
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
85.7 Generalization in the XCS Classifier System - Wilson (1998)(Correct)
This paper studies two changes to XCS, a classifier system in which fitness is based on prediction accuracy and the genetic algorithm takes place in environmental niches. The changes were aimed at inc... / Via more general syntax-e.g.Lisp s-expressions and operators drawn br creatures in this case Lisp programs-is evolved over
83.9 Coevolving High-Level Representations - Angeline (1994)(Correct)
Several evolutionary simulations allow for a dynamic resizing of the
genotype. This is an important alternative to constraining the genotype's
maximum size and complexity. In this paper, we add an add... / of Tierra the hierarchical LISP expression trees of the genetic br in both GPP and GLiB employ a LISP expression tree syntax to
83.9 Branch Classification: a New Mechanism for Improving Branch Predictor .. - Chang (1994)(Correct)
There is wide agreement that one of the most important
impediments to the performance of current and future
pipelined superscalar processors is the presence of conditional
branches in the instruction ... / the SPECint suite espresso lisp eqntott compress sc and gcc. br benchmarks. Because eqntott and lisp are not provided with different
83.0 On Understanding Types, Data Abstraction, and Polymorphism - Cardelli, Wegner (1985)(Correct)
Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming languages that reflects recent research in type theory, and examine the re... / memory S-expressions in pure Lisp l-expressions in the br interpretation of its contents. Lisp's S-expressions form another
82.4 Hierarchical Constraint Logic Programming - Wilson, Borning (1993)(Correct)
Constraint Logic Programming (CLP) is a general scheme for extending logic programming to include
constraints. It is parameterized by D, the domain of the constraints. However, CLP(D) languages,
as we... / interpreter written in Common Lisp for HCLP R In this version br a second interpreter in Common Lisp again for the domain of the real
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 Direct Algorithm for Type Inference in the Rank 2 Fragment of the.. - Kfoury, Wells (1994)(Correct)
We examine the problem of type inference for a family of
polymorphic type systems containing the power of Core-
ML. This family comprises the levels of the stratification of
the second-order -calculu... / of the ACM Conference on LISP and Functional Programming June br In Proc. ACM Conf. LISP Funct. Program.Snowbird Utah
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 and subroutines in genetic programming. The difficulty comes in
79.9 Wrappers to the Rescue - Brant, Foote, Johnson, Roberts (1998)(Correct)
Wrappers are mechanisms for introducing new behavior that is
executed before and/or after, and perhaps even in lieu of, an existing method.
This paper examines several ways to implement wrappers in ... / and Loops The Common Lisp Object System CLOS provides a br their arguments. They are similar to Lisp lambda-expressions in this
79.4 Static Type Checking of Multi-Methods - Agrawal, DeMichiel, Lindsay (1991)(Correct)
Multi-methods allow method selection to be based on the types of any number of arguments. Languages that currently support multi-methods do not support static type checking. We show how multi-methods ... / multi-methods e.g.the Common Lisp Object System CLOS and its br with CommonLoops The Common Lisp Object System CLOS supports
76.5 User Modeling and Adaptive Navigation Support in WWW-Based Tutoring.. - Weber, Specht (1997)(Correct)
Most learning systems and electronic textbooks accessible via the WWW up to
now lack the capabilities of individualized help and adapted learning support that are the
emergent features of on-site in... / To Support Learning Programming In Lisp. Elm-Art Ii Demonstrates How br supports learning programming in LISP. We show how the goals of
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 management systems existed the programming of file operations took a
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.
75.3 Provably Efficient Scheduling for Languages with Fine-Grained.. - Blelloch, Gibbons, Matias (1995)(Correct)
this paper has been extended
to generate the pdf-schedule for such languages by using a
2-3 tree data structure that maintains the ready set in the
appropriate priority order [BGMN97]. unknown [Hag91]... / In Proc. ACM Conf. on Lisp and Functional Programming pages br implicit memory management such as Lisp ML or Java. These languages
75.0 Higher-Order Logic Programming - Nadathur, Miller (1986)(Correct)
ly,
if a tactic R holds of G1 and G2, i.e., if (R G1 G2) is solvable from a presentation of primitive
tactics as a set of definite clauses, then satisfying the goal G2 in the object-language should su... / Modern programming languages such as Lisp Scheme and ML permit procedures to br is implemented in a language such as Lisp ML or Prolog then it would have
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 the Alto operating system and programming systems such as Lisp and Mesa
72.4 Reference Counting as a Computational Interpretation of Linear Logic - Chirimar, Gunter, Riecke (1996)(Correct)
We develop formal methods for reasoning about memory usage at a level of abstraction suitable for establishing or refuting claims about the potential applications of linear logic for static analysis. ... / of the ACM Conference on LISP and Functional Programming. The br coercions. In M. Wand editor Lisp and Functional Programming pages
72.1 Introducing OBJ - Goguen, Winkler, Meseguer.. (1993)(Correct)
This is an introduction to OBJ, describing its philosophy, its syntax, its history, and aspects of
its semantics, both logical and operational. Many examples are given, using Release 2 of OBJ3,
which ... / OBJ objects can also encapsulate Lisp code e.g.to provide efficient br system is implemented in Common Lisp and is based on ideas from order
70.5 Collection-Oriented Languages - Sipelstein (1991)(Correct)
This research was supported in part by the Defense Advanced Research Projects Agency (DOD) and monitored
by the Avionics Laboratory, Air Force Wright Aeronautical Laboratories, Aeronautical Systems Di... / Apl arrays Connection Machine Lisp xectors Paralation Lisp br Lisp xectors Paralation Lisp paralations And Setl sets
69.5 Automatically Configuring Constraint Satisfaction Programs: A Case.. - Minton (1996)(Correct)
Multi-tac is a learning system that synthesizes heuristic constraint satisfaction programs.
The system takes a library of generic algorithms and heuristics and specializes them for
a particular appl... / The output of the system is a Lisp program that is tailored to the br configuration by compiling a Lisp program that implements 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
69.1 Notes on typed object-oriented programming - Fisher, Mitchell (1994)(Correct)
This paper, which is partly tutorial in nature, summarizes
some basic research goals in the study and development of typed objectoriented
programming languages. These include both immediate repairs
... / Conventional Object-oriented Lisp Smalltalk ML C CIn the br conventional languages. These are Lisp which is an essentially pure
68.9 Operational aspects of linear lambda calculus - Lincoln (1992)(Correct)
Linear logic is a resource-aware logic that is based on an analysis of the classical proof rules of contraction (copying) and weakening (throwing away). Several previous researchers have studied funct... / machine is written in Common Lisp with garbage collection in br in non-linear memory handled by the Lisp garbage collector. In the next
68.9 Species Adaptation Genetic Algorithms: A Basis for a Continuing SAGA - Harvey (1992)(Correct)
For Artificial Life applications it is useful to
extend Genetic Algorithms from a finite search
space with fixed-length genotypes to open-ended
evolution with variable-length genotypes. A
new theoreti... / which are given in the form of LISP S-expressions these can be br Smith Koza's genetic programming Koza The first of
68.5 Modular Domain Specific Languages and Tools - Hudak (1998)(Correct)
A domain specific language (DSL) allows one to
develop software for a particular application domain
quickly and e#ectively, yielding programs that are
easy to understand, reason about, and maintain. O... / language is not new of course. Lisp macros have been used for years to br of the ACM Symposium on Lisp and Functional Programmming
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
68.0 A Direct Algorithm for Type Inference in the Rank 2 Fragment of the.. - Kfoury, Wells (1993)(Correct)
We study the problem of type inference for a family of polymorphic type disciplines containing
the power of Core-ML. This family comprises all levels of the stratification of the
second-order lambda-c... / In Proc. ACM Conf. LISP Funct. Program.Snowbird Utah br type systems for functional programming languages use polymorphic type
67.0 Dynamic Typing in a Statically Typed Language - Abadi, Cardelli, Pierce, Plotkin (1989)(Correct)
Statically typed programming languages allow earlier error checking, better enforcement
of disciplined programming styles, and generation of more efficient object code
than languages where all type co... / to support programming idioms from LISP. Shaffert and Scheifler gave a br this problem particularly in the Lisp community. Many Lisp systems
66.6 Back to Direct Style II: First-Class Continuations - Danvy, Lawall (1995)(Correct)
We continue to investigate the direct-style transformation by extending it to programs with
first-class continuations. Starting from our direct-style transformer towards pure, call-by-value
functional... / of the ACM Conference on Lisp and Functional Programming William br William Clinger editor LISP Pointers Vol. V No. pages
66.6 Powerlist: A Structure for Parallel Recursion - Misra (1994)(Correct)
Many data parallel algorithms -- Fast Fourier Transform, Batcher's
sorting networks and prefix-sum -- exhibit recursive structure. We propose
a data structure, powerlist, that permits succinct descrip... / on which recursion is employed in LISP or ML is a list. A list br blends well with ML and LISP A mixture of linear lists
66.1 Equivalence in Functional Languages with Effects - Mason, Talcott (1991)(Correct)
Traditionally the view has been that direct expression of control and store
mechanisms and clear mathematical semantics are incompatible requirements. This paper
shows that adding objects with memory ... / from that of memory allocation Lisp and Scheme adopt both the br terms of if. cond is the usual Lisp conditional. e e
64.6 Automatic Autoprojection of Recursive Equations with Global Variables .. - Bondorf, Danvy (1990)(Correct)
Self-applicable partial evaluation has been implemented for half a decade now, but many problems remain open. This paper addresses and solves the problems of automating call unfolding, having an open-... / was first order statically scoped Lisp-type recursive equations over br to specify everything as for example Lisp-type lists yields too low-level
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.6 Compiling Collection-Oriented Languages onto Massively Parallel.. - Blelloch (1990)(Correct)
This paper introduces techniques for compiling the nested parallelism of collectionoriented
languages onto existing parallel hardware. Programmers of parallel machines
encounter nested parallelism ... / language Paralation Lisp into the instruction set of a br CM- sort. Keywords Paralation Lisp Scan Compiler Connection
63.8 Multimodal User Interfaces in the Open Agent Architecture - Moran, Cheyer, Julia, Martin (1997)(Correct)
The design and development of the Open Agent Architecture
(OAA)
1
system has focused on providing access to agentbased
applications through an intelligent, cooperative, distributed,
and multimodal a... / supported languages are C Prolog Lisp Java Microsoft s Visual Basic br interface to their application programming interfaces APIs if they
63.7 Global Tagging Optimization by Type Inference - Henglein (1992)(Correct)
Tag handling accounts for a substantial amount of execution
cost in latently typed languages such as Common LISP and
Scheme, especially on architectures that provide no special
hardware support.
We pr... / typed languages such as Common LISP and Scheme especially on br in several respects. ffl In the LISP compiler for S BGS in Orbit
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 Caching Considerations for Generational Garbage Collection - Wilson (1992)(Correct)
Smalltalk, Lisp, or
actor languages typically violate some of the basic lo-
Appears in Proc. 1992 ACM Conf. on Lisp and Functional
Programming, San Francisco, California, June 2224,
1992, pp. 32--4... / systems such as Smalltalk Lisp or actor languages typically br Appears in Proc. ACM Conf. on Lisp and Functional Programming San
63.7 A modular module system - Leroy (1996)(Correct)
A simple implementation of a SML-like module system is presented as a module
parameterized by a base language and its type-checker. This demonstrates constructively
the applicability of that module ... / of meta-circular interpretors for Lisp. We hope that far from making this br macro definitions in C and Lisp For these languages the
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 directly in the implementation programming language. However some domains
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 The Marriage of Effects and Monads - Wadler, Thiemann (1998)(Correct)
Gifford and others proposed an effect typing discipline to delimit
the scope of computational effects within a program,
while Moggi and others proposed monads for much the same
purpose. Here we marry ... / such as FX GJLS a variant of Lisp while monads are typically found br programming ACM Conference on Lisp and Functional Programming
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
61.8 A Tractable Scheme Implementation - Kelsey, Rees (1993)(Correct)
Scheme 48 is an implementation of the Scheme programming language constructed
with tractability and reliability as its primary design goals. It has the structural
properties of large, compiler-based... / Lisp And Symbolic Computation An br properties of large compiler-based Lisp implementations it is written
61.7 Soft Typing - Cartwright, Fagan (1991)(Correct)
This paper presents a soft type systems that retains the expressiveness of dynamic typing, but offers the early error detection and improved optimization capabilities of static typing. The key idea un... / the head operation car in Lisp is defined only for non-empty br example. Consider the well-known Lisp function reverse that takes a
60.2 Static Type Inference in a Dynamically Typed Language - Aiken, Murphy (1991)(Correct)
We present a type inference system for FL based on an operational, rather than a denotational, formulation
of types. The essential elements of the system are a type language based on regular trees and... / such as the functional subsets of Lisp and Scheme. An Overview of FL br Thatte presents a type system for Lisp designed to detect statically some
58.6 Representing Control in the Presence of First-Class Continuations - Hieb, Dybvig, Bruggeman (1990)(Correct)
Languages such as Scheme and Smalltalk that provide continuations as first-class data objects present a challenge to efficient implementation. Allocating activation records in a heap has proven unsati... / for nonlocal exits as in Common Lisp then the essence of a br of the ACM Conference on Lisp and Functional Programming August
57.9 Balancing Accuracy and Parsimony in Genetic Programming - Zhang, Mühlenbein (1995)(Correct)
Genetic programming is distinguished from other evolutionary algorithms in that it uses tree representations
of variable size instead of linear strings of fixed length. The flexible representation sch... / general case the programs can be LISP S-expressions representing a br and Parsimony in Genetic Programming Byoung-Tak Zhang Heinz
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 algorithms programming languages
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
56.7 A Logic Programming Approach To Manipulating Formulas And Programs - Miller, Nadathur (1994)(Correct)
First-order Horn clause logic can be extended to a higher-order setting in which function and predicate symbols can be variables and terms are replaced with simply typed -terms. For such a logic pro... / higherorder features present in Lisp-like languages through mechanisms br difference here is that it adopts a Lisp-like notation for writing terms
56.0 Active Objects in Hybrid - Nierstrasz (1987)(Correct)
Most object-oriented languages are strong on reusability or on strong-typing, but weak on concurrency.
In response to this gap, we are developing Hybrid, an object-oriented language in which
objects a... / C Cox CStro and Lisp with flavors Wein and more br been in terms of object-oriented Lisp using the flavors package
55.3 Effective Bayesian Inference for Stochastic Programs - Daphne Koller (1997)(Correct)
In this paper, we propose a stochastic version of a general purpose
functional programming language as a method of modeling
stochastic processes. The language contains random
choices, conditional stat... / Gamma correspond to the Lisp functions car and cdr br of a general purpose functional programming language as a method of
55.0 A HOL Extension of GNY for Automatically Analyzing Cryptographic.. - Brackin (1996)(Correct)
This paper describes a Higher Order Logic (HOL) theory formalizing an extended version of the Gong, Needham, Yahalom (GNY) belief logic, a theory used by software that automatically proves authenticat... / programming language with Lisp-level expressive power and better br ffl SML is a general-purpose programming language with Lisp-level
55.0 Evolving Turing-Complete Programs for a Register Machine with.. - Nordin, Banzhaf (1995)(Correct)
The majority of commercial computers today are register machines of von Neumann type. We have developed a method to evolve Turing-complete programs for a register machine. The described implementation... / and up to times compared to a LISP implementation. The use of binary br form is the S-expressions common in LISP. This representation guarantees
55.0 Elf: A Language for Logic Definition and Verified Metaprogramming - Pfenning (1989)(Correct)
We describe Elf, a metalanguage for proof manipulation
environments that are independent of any particular
logical system. Elf is intended for meta-programs
such as theorem provers, proof transformers... / An implementation of Elf in Common Lisp is currently in progress in the br An implementation of Elf in Common Lisp is in progress in the framework of
54.5 Challenges of Symbolic Computation - My Favorite Open Problems - Kaltofen (1999)(Correct)
this paper, R. Corless
and D. Jeffrey state an additional open problem, which was presented by Corless in his
lecture at Fifth East Coast Computer Algebra Day in April 1998.
A Brief History of Symboli... / types of domains in symbolic programming languages computational group br primality tests. Generic programming is invented in the first half
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 are met by the Agent-Oriented Programming paradigm of Distributed
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
54.3 A Common LISP Hypermedia Server - Mallery (1994)(Correct)
A World-Wide Web (WWW) server was implemented in Common LISP in order to
facilitate exploratory programming in the global hypermedia domain and to provide access to complex
research programs, partic... / A Common LISP Hypermedia Server John C. br server was implemented in Common LISP in order to facilitate exploratory
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 Artificial Intelligence. Genetic Programming is used to evolve behavioral
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.5 Computational Reflection in Software Process Modeling: the SLANG.. - Bandinelli, Fuggetta (1993)(Correct)
Software production processes are subject to changes during their life-time. Therefore, software process
formalism must include mechanisms to support the analysis and dynamic modification of process m... / community. Languages such as LISP and Prolog allow programs to be br manipulated as data for example a Lisp program is a list that can be
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 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
51.4 Symbolic Simulation: an ACL2 Approach - Moore (1998)(Correct)
Executable formal specification can allow engineers to test
(or simulate) the specified system on concrete data before the system is
implemented. This is beginning to gain acceptance and is just the... / in executable logics such as Pure Lisp or other functional programming br version of the Boyer-Moore Pure Lisp theorem prover where it was
51.0 Applying Genetic Programming to Evolve Behavior Primitives and.. - Wei-Po Lee (1997)(Correct)
Behavior-based approach has been successfully
applied to design the control system of a robot. This
paper presents our approach, based on evolutionary algorithms,
to program behavior-based robots auto... / robot controllers in the forms of LISP-like programs neural networks or br Applying Genetic Programming to Evolve Behavior Primitives
49.4 Space Efficient Conservative Garbage Collection - Boehm (1993)(Correct)
We call a garbage collector conservative if it has only partial information about the location of pointers, and is thus forced to treat arbitrary bit patterns as though they might be pointers, in at l... / Scheme ML Common Lisp AKCL Mesa and CLU br themselves instead of separate lispstyle cons'cells. If objects
49.2 Lua - an extensible extension language - Ierusalimschy, de Figueiredo, Filho (1996)(Correct)
This paper describes Lua, a language for extending applications. Lua combines procedural
features with powerful data description facilities, by using a simple, yet powerful,
mechanism of tables. This ... / programming languages such as Lisp and C. Such configuration languages br some other language mechanisms. Lisp dialects particularly Scheme have
48.2 The Troubling Aspects of a Building Block Hypothesis for Genetic.. - O'Reilly, Oppacher (1992)(Correct)
In this paper we carefully formulate a Schema Theorem for Genetic Programming
(GP) using a schema definition that accounts for the variable length and the
non-homologous nature of GP's representation.... / trees. A schema is a set of LISP S-expressions i.e.a set of br Block Hypothesis for Genetic Programming Una-May O'Reilly Santa Fe
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 Continuation-Based Partial Evaluation - Lawall, Danvy (1993)(Correct)
Binding-time improvements aim at making partial evaluation
(a.k.a. program specialization) yield a better result.
They have been achieved so far mostly by hand-transforming
the source program. We obse... / At the Lisp conference Clinger Hartheimer br of the ACM Conference on Lisp and Functional Programming LISP
47.4 Programmable Syntax Macros - Weise, Crew (1993)(Correct)
Lisp has shown that a programmable syntax macro system
acts as an adjunct to the compiler that gives the programmer
important and powerful abstraction facilities not provided by
the language. Unlike s... / Research Laboratory Abstract Lisp has shown that a programmable br mechanism was modeled after Lisp's We have designed and
47.0 Basic Polymorphic Typechecking - Cardelli (1988)(Correct)
This
paper is largely concerned with implicit polymorphism; it is nonetheless important to
dedicate the rest of this section to the relationships between the two kinds of parametric
polymorphism. unkn... / ordered sets. On the other hand a Lisp routine to sort integers can be br Language Proceedings of the LISP Conference Stanford August
46.8 Feature-Oriented Programming: A Fresh Look at Objects - Prehofer (1997)(Correct)
We propose a new model for flexible composition of objects
from a set of features. Features are similar to (abstract) subclasses, but
only provide the core functionality of a (sub)class. Overwriting... / mix-ins around-messages in Lisp class refactoring methods br Understanding CLOS the Common LISP object system. Digital Press
46.7 Abstracting Control - Danvy, Filinski (1990)(Correct)
The last few years have seen a renewed interest in continuations for expressing advanced control structures in programming languages, and new models such as Abstract Continuations have been proposed t... / akin to the difference between Lisp and Scheme. The new idea is that a br FUNCTION around a LAMBDA in Lisp . which experience has shown to
46.3 The Development of Type Systems for Object-Oriented Languages - Fisher, Mitchell (1996)(Correct)
This paper, which is partly tutorial in nature, summarizes
some basic research goals in the study and development
of typed object-oriented programming languages. These
include both immediate repairs t... / Conventional Object-oriented Lisp Smalltalk ML C CIn the br conventional languages. These are Lisp which is an essentially pure
46.3 ACL2 Theorems about Commercial Microprocessors - Brock, Kaufmann, Moore (1996)(Correct)
ACL2 is a mechanized mathematical logic intended for use
in specifying and proving properties of computing machines. In two independent
projects, industrial engineers have collaborated with research... / Logic for Applicative Common Lisp.ACL is both a mathematical br which formalizes a subset of Common Lisp is a high level programming
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 Developing A Reflective Model of Collaborative Systems - Dourish (1995)(Correct)
Recent years have seen a shift in perception of the nature of HCI and interactive systems. As interface work
has increasingly become a focus of attention for the social sciences, we have expanded our ... / can be made by modifying the Lisp code that they contain. Buttons br as part of the execution model of -Lisp a reflective dialect of the Lisp
46.3 Composing Haggis - Finne, Jones (1995)(Correct)
Haggis is a purely-functional, multi-threaded user interface framework
for composing interactive applications. It provides a compositional view of the
world of user interface applications, applying to... / mostlyfunctional languages such as Lisp and SML in that non-strict br geometry. In ACM Symposium on LISP and Functional Programming pages
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 prototype architecture for future programmable video decoders. Rather than
46.0 Assuring Good Style for Object-Oriented Programs - Lieberherr, Holland (1989)(Correct)
We introduce a simple, programming language independent rule (known in-house as
the Law of Demeter) which encodes the ideas of encapsulation and modularity in an
easy to follow form for the object-ori... / about fourteen thousand lines of Lisp Flavors and now about ninety br class dictionaries. Journal on Lisp and Symbolic Computation
45.7 LISA: A Specification Language Based on WS2S - Ayari, Basin, Podelski (1998)(Correct)
We integrate two concepts from programming languages into
a specification language based on WS2S, namely high-level data structures
such as records and recursively-defined datatypes (WS2S is the
wea... / languages like assembly languages Lisp and Fortran provided little or br We integrate two concepts from programming languages into a specification
45.7 Transforming the Theorem Prover into a Digital Design Tool: From.. - Hardin, Wilding, Greve (1998)(Correct)
As digital designs grow evermore complex and design cycles
become ever shorter, traditional informal methods of design verification
are proving inadequate. Design teams are increasingly turning to f... / -an applicative subset of Common Lisp -that we hope can support our br prover for a logic based on Common Lisp. IEEE Transactions on Software
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.5 An Ad-Hoc Approach to the Implementation of Polymorphism - R. Morrison, A. Dearle, R.C.H.. (1991)(Correct)
types have existential type". 12th ACM
Symposium on Principles of Programming Languages, New Orleans, (January
1985), 37-51.
[SFS90] Stemple, D., Fegaras, L., Sheard, T. & Socorro, A. "Exceeding the L... / applicative language ACM Lisp Conference - New br ACM Symposium on Principles of Programming Languages Austin Texas
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.8 A Control-Flow Normalization Algorithm and Its Complexity - Ammarguellat (1992)(Correct)
We present a simple method for normalizing the control-flow of programs
to facilitate program transformations, program analysis, and automatic
parallelization. While previous methods result in program... / written in languages such as Common Lisp Fortran Pascal or C. Second the br Figure A sample of recursive Lisp program defun f lambda x y
44.8 Reasoning with Continuations II: Full Abstraction for Models of.. - Sitaram, Felleisen (1992)(Correct)
ion for Models of Control
Two Corrections
Dorai Sitaram Matthias Felleisen
Department of Computer Science
Rice University
Houston, TX 77251-1892
July 29, 1992
1 Environments for Pcf v
The original pa... / In Proc. ACM Conference on Lisp and Functional Programming br Conference on Lisp and Functional Programming - . . Riecke
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
44.4 Is Continuation-Passing Useful for Data Flow Analysis? - Amr Sabry (1994)(Correct)
Interpretation
Exploiting well-known ideas from the area of abstract interpretation [4, 9, 14, 16], we derive a data
flow analyzer from each of the previous interpreters. The first step in the deriva... / higher-order languages like Scheme Lisp and ML and contains all the br of the ACM Conference on Lisp and Functional Programming
43.4 What Not to Do When Writing an Interpreter for Specialisation - Jones (1996)(Correct)
A partial evaluator, given a program and a known "static"
part of its input data, outputs a specialised or residual program in which
computations depending only on the static data have been performe... / the reader may think of D as Lisp Scheme lists and programs as br dynamic. The consequence is as in Lisp that target programs obtained by
43.2 Logical Support for Modularisation - Diaconescu, Goguen, Stefaneas (1993)(Correct)
Modularisation is important for managing the complex structures that
arise in large theorem proving problems, and in large software and/or hardware development
projects. This paper studies some prop... / languages such as pure Lisp and pure Prolog. In it is br Goguen y Petros Stefaneas Programming Research Group Oxford
43.2 Generality and Difficulty in Genetic Programming: Evolving a Sort - Kinnear, Jr. (1993)(Correct)
Genetic Programming is applied to the task of
evolving general iterative sorting algorithms. A
connection between size and generality was discovered.
Adding inverse size to the fitness measure
along w... / tree structured programs typically LISP functions Koza br that undergo adaptation are LISP s-expressions composed of
43.1 Automatic Programming of Robots using Genetic Programming - Koza (1992)(Correct)
The goal in automatic programming is to get a computer to perform a task by telling it what needs to be done, rather than by explicitly programming it. This paper considers the task of automatically g... / expressions S-expressions of the LISP programming language are an br above. These S-expressions in LISP correspond directly to the parse
41.9 Stack-Based Genetic Programming - Perkis (1994)(Correct)
Some recent work in the field of Genetic Programming (GP) has been
concerned with finding optimum representations for evolvable and
efficient computer programs. In this paper, I describe a new GP syst... / process is employed to develop LISP programs. Unlike conventional GA br consisting of randomly generated LISP s-expressions. Each expression is
41.3 Metalogical Frameworks - Basin, Constable (1992)(Correct)
In computer science we speak of implementing a logic; this is done in a programming
language, such as Lisp, called here the implementation language. We also reason
about the logic, as in understanding... / in a programming language such as Lisp called here the implementation br a logic this is done in a programming language such as Lisp called
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