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.
An Indexed Bibliography of Genetic Algorithms and Neural Networks - Jarmo T. Alander (2001)(Correct)
s: July 1996 - Nov. 1997
ffl ChA: Chemical Abstracts: Jan. 1997 - Aug. 1998
ffl CA: Computer Abstracts: Jan. 1993 -- Feb. 1995
ffl CCA: Computer & Control Abstracts: Jan. 1992 -- Apr. 1998 (except ... / Germany gaGPbib.ps.Z genetic programming gaIMPLEbib.ps.Z br pattern recognition genetic programming controllers
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
Persistent LISP Objects - PLOB! - Kirschke (2000)(Correct)
This document covers P L O B ! version 2.08 released at 1. December
1998.
Contents
1 Introduction 1 unknown Persistent LISP Objects
P
L
O
B
!
Internal Interface
1. December 1998
Heiko Kirschke
P... / Persistent LISP Objects P L O B br . lisp-code-type
An Indexed Bibliography of Genetic Algorithms in Japan - Jarmo T. Alander (2000)(Correct)
s: Jan. 1995 { Sep. 1998
ACM: ACM Guide to Computing Literature: 1979 - 1993/4
BA: Biological Abstracts: July 1996 - Aug. 1998
CA: Computer Abstracts: Jan. 1993 { Feb. 1995
CCA: Computer &... / Germany gaGPbib.ps.Z genetic programming gaIMPLEbib.ps.Z br manufacturing genetic programming analysing GA CAD
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
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
Publications by Erich Kaltofen - Kaltofen (1999)(Correct)
Introduction to My Online Bibliography
In the following the BASE URL for the online document
is http://www.math.ncsu.edu/~kaltofen/
bibliography. Many of my publications are accessible
through links... / The archive directory of the Lisp program source code is at br archive directory of the C CLisp and Maple program source code is
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
A framework for the analysis of syntactic replacement restrictions - Lucas (1999)(Correct)
We formalize the notion of syntactic replacement restriction, which is useful for
modeling reduction-based systems which compute with terms and impose restrictions
on the possible computations (typica... / for complete implementations of Lisp McC McC originated the br in the computational model of Lisp the authors of these works studied
The Napier88 Persistent Programming Language and Environment - Morrison, Connor, Cutts, Kirby.. (1999)(Correct)
Persistent programming systems are designed as an implementation
technology for long lived, concurrently accessed and potentially large bodies of
data and programs, known here as persistent applicat... / Edwards DJ Hart TP Levin MI. The Lisp Programmers' Manual. M.I.T. Press br The Napier Persistent Programming Language and Environment
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 as very high level declarative programming languages. Consequently
Mechanically Verifying Real-Valued Algorithms in ACL2 - Gamboa (1999)(Correct)
vi
List of Tables x
Chapter 1 Introduction 1
1.1 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.2 Outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . .... / on the programming language Common LISP. ACL is also an automated theorem br to keep ACL as close to Common LISP as possible and Common LISP
MetaML and Multi-Stage Programming with Explicit Annotations - Taha, Sheard (1999)(Correct)
We introduce MetaML, a practically-motivated, staticallytyped
multi-stage programming language. MetaML is a "real" language.
We have built an implementation and used it to solve multi-stage proble... / code fragments. Relationship to LISP MetaML has three annotations br and Run that are analogous to LISP's back-quote comma and eval
Declarative Numerical Analysis: an Interval Constraint-based Approach - Hickey (1999)(Correct)
end the work
in the previous grant in three directions:
Computer Science Department, Brandeis University, Waltham, Massachusetts.
2
1. Primitive Constraint Contractions -- the development of fast... / of Nondeterministic Common Lisp. Technical report - U. Penn. br derived from constraint logic programming are used to minimize the
Pattern Matching as Cut Elimination - Cerrito, Kesner (1999)(Correct)
We present a typed pattern calculus with explicit pattern matching and explicit substitutions, where
both the typing rules and the reduction rules are modeled on the same logical proof system, namely
... / pattern matching features such as LISP. On the other hand calculi br between S modal logic and LISP's eval and quote primitives in
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
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
An Approach to Animating Model-Based Object-Oriented Formal.. - Czarnecki, Zhang, Lano (1999)(Correct)
One of the important issues in the application
of formal notations in software development is the validation
of formal specifications against the informal customer
requirements. Animation has been pro... / program. Morrey et al. use Lisp for animating Z br J. Briggs and G. Buckberry A LISPbased environment for animating Z
Programming by Demonstration: An Inductive Learning Formulation - Lau, Weld (1999)(Correct)
Although Programming by Demonstration (PBD) has
the potential to improve the productivity of unsophisticated
users, previous PBD systems have used brittle,
heuristic, domain-specific approaches to exe... / Tinker supports programming Lisp by demonstration but performs no br We use Mooney's Common Lisp version-space implementation
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 typically developed by a team of programmers including experts from the
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
Symbolic Computation in Java: an Appraisement - Bernardin, Char, Kaltofen (1999)(Correct)
Windowing
Toolkit and the Swing components from the Java Foundation
Classes. Internet browsers contain Java virtual machines
for interpreting byte code of Java programs that are
embedded into Internet... / management Computing languages like Lisp Java and Maple perform automatic br components in comparison with CLisp Smalltalk and Maple Mathematica.
Rule-Based Query Optimization, Revisited - Warshaw, Miranker (1999)(Correct)
We present an overview and initial performance assessment of a rule-based query optimizer written in VenusDB.
VenusDB is an active-database rule language embedded in C++. Following the developments in... / techniques these systems used LISP and LISPlike data structures which br these systems used LISP and LISPlike data structures which make it
Typed Exceptions and Continuations Cannot Macro-Express Each Other - Riecke, Thielecke (1999)(Correct)
The most powerful control constructs in modern programming languages
are continuations and exceptions. Although they can be used interchangeably
in some cases, they are fundamentally different seman... / to introduce assignment into pure LISP merely by a definition. The proof br which seems more powerful and LISP has no handlers which seems less
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
IDA Assistance for Mixed-Initiative Planning - Amant (1999)(Correct)
In mixed-initiative planning, a human planner collaborates
with an automated system to build a plan of action. In existing approaches,
the participants incrementally add constraints or modifications... / and Aide. Clasp the Common Lisp analytical statistics package is br Paul R. Cohen. Clasp Clip Common Lisp Analytical Statistics Package
C++ Templates as Partial Evaluation - Veldhuizen (1999)(Correct)
This paper explores the relationship between C++ templates and partial evaluation.
Templates were designed to support generic programming, but unintentionally provided
the ability to perform compile-t... / an interpreter for a subset of Lisp which runs at compile time br for multi-level specialization Lisp and Symbolic Computation
Distributed Mediation using a Light-Weight OODBMS - Josifovski, Risch (1999)(Correct)
An overview is given of a light-weight, Object-Oriented (OO), multi-database
system, named AMOS II. Object-Oriented multi-database queries and views
can be defined where external data sources of diffe... / in an external language Java C or Lisp and to associate costs and br programs in Java C and Lisp. Applications always access
Structured Theory Development for a Mechanized Logic - Kaufmann, Moore (1999)(Correct)
Experience has shown that large or multi-user interactive proof efforts
can benefit significantly from structuring mechanisms, much like those
available in many modern programming languages. Such a me... / Logic for Applicative Common Lisp not only for ACL but also for br no familiarity with ACL or Common Lisp providing the necessary
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
Declarative Internet Programming Constraint-based Optimization of.. - Hickey (1999)(Correct)
no abstract-- unknown Declarative Internet Programming
Constraint-based Optimization of Scheme Applets
Timothy J. Hickey
,
February 16, 1999
1 Proposed research
This proposal addresses both theor... / server project in which Common Lisp is used to implement an HTTP br can then run servelets written in LISP. Java's greatest strengths beyond
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
Chunks in PLAN: Language Support for Programs as Packets - Moore, Hicks, Nettles (1999)(Correct)
Chunks are a programming construct in PLAN, the
Packet Language for Active Networks, comprised of
a code segment and a suspended function call. In
PLAN, chunks provide support for encapsulation and
ot... / Unlike the uses of code as data in Lisp-like languages we so far we have br Abstract Chunks are a programming construct in PLAN the Packet
Scoping Constructs for Program Generators - Batory (1999)(Correct)
A well-known problem in program generation is scoping. When iden-tifiers (i.e., symbolic names) are used to refer to variables, types, or functions, program generators must ensure that generated ident... / operators are similar to the LISP backquote and comma macro pair br of the C language that generates LISP code. While this distinction seems
A Mechanically Checked Proof of a Multiprocessor Result via a.. - Strother Moore (1999)(Correct)
We describe a mechanically checked correctness proof for a system of
n processes, each running a simple, non-blocking counter algorithm. We
prove that if the system runs longer than 5n steps, the cou... / is formalized in applicative Common Lisp and proved with the ACL theorem br We formalize the problem in Common Lisp which is supported by the ACL
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 An efficient dynamic programming algorithm to find an optimal
Proving Theorems about Java-like Byte Code - Moore (1999)(Correct)
We describe a formalization of an abstract machine very similar to the Java Virtual Machine but far
simpler. We develop techniques for specifying the properties of classes and methods for this machine... / Logic for Applicative Common Lisp. The tradition of formalizing br of the machine is represented as a Lisp object. An interpreter for the
Computing with Data: Concepts and Challenges - Chambers (1999)(Correct)
This paper examines work in "computing with data"---in computing support
for scientific and other activities to which statisticians can contribute.
Relevant computing techniques, besides traditional s... / the MIT press publication of the Lisp manual McCarthy ffl br as a central tool for science. The Lisp language like Fortran remains an
Chapter 13: Sub-machine-code Genetic Programming - Poli, Langdon (1999)(Correct)
Introduction
Genetic Programming (GP) [Koza, 1992; Koza, 1994; Banzhaf et al., 1998] is usually seen
as quite demanding from the computation load and memory use point of view. So, over
the years a nu... / a number of tricks to speed up his Lisp GP implementation. However soon br go beyond the inefficiencies of the Lisp language and some GP
An empirical study of the efficiency of learning boolean functions.. - Miller (1999)(Correct)
A new form of Genetic Programming (GP) called Cartesian Genetic Programming (CGP) is proposed in which programs
are represented by linear integer chromosomes in the form of connections and functionali... / addresses in data arrays. Unlike LISP expressions there are no br Category Genetic programming An empirical study of the
Reflecting Java into Scheme - Kenneth Anderson (1999)(Correct)
We describe our experience with SILK, a Scheme dialect written in
Java. SILK grazes symbiotically on Java's reflective layer, enriching itself with
Java's classes and their behavior. This is done wi... / Computer Science Following Common Lisp SILK provides generic functions. br typed language that uses simple Lisp syntax. A Scheme program is built
Contextual Programming (Extended Abstract) - Walker (1999)(Correct)
Robert J. Walker
Department of Computer Science
University of British Columbia
201-2366 Main Mall
Vancouver, BC, Canada V6T 1Z4
+1 604 822 3061
walker@cs.ubc.ca
ABSTRACT
When information externa... / Dynamic scoping e.g.in Lisp allows names to be bound into an br Contextual Programming Doctoral
LINK: A system for graph computation - Berry, Dean, Goldberg, al. (1999)(Correct)
This paper will describe the basic
architecture of the system and illustrate its flexibility with several examples.
These descriptions will be accompanied by commentary on the associated design
decisi... / extension based on the Common Lisp Object System called STklos as br Tk enables involved graphics programming without any knowledge of
Type-Secure Meta-Programming - Dornan (1998)(Correct)
This dissertation considers a new approach to embedding dynamic-typing facilities
in a statically-typed functional programming language like ML, Miranda
and Haskell.
Currently, functional programs are... / idea from languages like SASL and LISP with exclusively dynamic typing br is most strongly associated with LISP founded on the principle that a
Interleaving Natural Language Parsing and Generation Through Uniform.. - Neumann (1998)(Correct)
We present a new model of natural language processing in which natural language
parsing and generation are strongly interleaved tasks. Interleaving of parsing
and generation is important if we assume ... / been fully implemented in Common Lisp and CLOS and tested with br been implemented in CLOS the Common Lisp Object System Steele you
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
Programming with Variable Functions - Odersky (1998)(Correct)
What is a good method to specify and derive imperative
programs? This paper argues that a new form of functional
programming fits the bill, where variable functions
can be updated at specified points... / impure functional languages such as Lisp or Scheme. In those languages every br Henry G. Baker. Lively linear Lisp-look ma no garbage ACM
A Customisable Memory Management Framework for C++ - Attardi, Flagella, Iglio (1998)(Correct)
Automatic garbage collection relieves programmers from the burden of managing memory themselves
and several techniques have been developed that make garbage collection feasible in many situations,
inc... / direct pointer manipulation Lisp Java using tagged pointers br collectors like for instance Lisp and Prolog. And finally as argued
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
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
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
A Survey of Intelligent Debugging - Stumptner, Wotawa (1998)(Correct)
this paper is to examine
recent and current debugging approaches that
promise to have the potential of going a step further
along the road towards automatic program debugging.
Traditionally, automated... / programs written in a subset of LISP attempts what is called a br programs as well as about typical programmer errors occurring in exactly
Tagging and Morphological Processing in the svensk System - Olsson (1998)(Correct)
This thesis describes the work of providing separate morphological processing and
part-of-speech tagging modules in the svensk system by integrating the Uppsala Chart Processor
(UCP) and a Brill tag... / this case the languages are Common LISP Perl and C and to have them br GATE using the Tcl Tk application programmers interface API and a
Program Comprehension in Multi-Language Systems - Kullbach, Winter, Dahm, Ebert (1998)(Correct)
This paper presents an approach to program comprehension
in multi-language systems. Such systems are characterized
by a high amount of source codes in various languages
for programming, database defin... / syntax trees LISP images or hybrid knowledge br codes in various languages for programming database definition and job
Achieving Robust Human-Computer Communication - Susan Mcroy (1998)(Correct)
This paper describes a computational approach to robust human-computer interaction. The
approach relies on an explicit, declarative representation of the content and structure of
the interaction that ... / is being developed using the Common LISP programming language. We are using br server-side program that initiates a LISP process. The Bayesian
Robot Learning using Gate-Level Evolvable Hardware - Keymeulen, Konaka, Iwata, Kuniyoshi, .. (1998)(Correct)
Recently there has been a great interest in the design and
study of evolvable and autonomous systems in order to control the behavior
of physically embedded systems such as a mobile robot. This
pape... / behavior modules described in LISP-like programming languages br level control architecture such as LISP-like programming languages
Approaches to Parallel Quantifier Elimination - Dolzmann, Gloor, Sturm (1998)(Correct)
Special-purpose quantifier elimination procedures for problems of low degree using virtual substitution of test terms have recently turned out to be applicable to a variety of non-trivial non-academic... / extension of the Portable Standard Lisp psl system underlying br the S-threads parallel symbolic programming environment Kuc a
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
Running Programs Backwards: The Logical Inversion of Imperative.. - Ross (1998)(Correct)
The feasibility of inverting imperative computations using logic programming technology
is informally explored. Program inversion is the process of determining the possible input
values that will prod... / inversions have been introduced to Lisp Kor fold and unfold br computations using logic programming technology is informally
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
Design and implementation of a parallel cellular language for MIMD.. - Vialle, Lallement, Cornu (1998)(Correct)
In this paper we present a new language, called ParCeL-1, intended to make easier the implementation
of computation-intensive and artificial intelligence applications on highly parallel MIMD
architect... / is a parallel extension of Common-Lisp. Simple data structures and br and operations are implemented in Lisp without involving any actor-based
FOXBOX: A System for Manipulating Symbolic Objects in Black Box.. - Díaz, Kaltofen (1998)(Correct)
The FOXBOX system puts in practice the black box representation
of symbolic objects and provides algorithms for performing
the symbolic calculus with such representations. Black box objects
are stored... / say wishes to access the Cprogrammed black box algorithms in the br computation systems. Generic programming methodology allows us the use
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
Execution Characteristics of Object Oriented Programs on the.. - Radhakrishnan, John (1998)(Correct)
It is widely accepted that object-oriented design improves code reusability, facilitates code
maintainability and enables higher levels of abstraction. Although software developers and
the software en... / over an images. li Li is a Lisp interpreter written in C. The br XLISP is a small implementation of Lisp with object-oriented programming.
Understanding the Branch Performance of Object Oriented Workloads - Radhakrishnan Tang (1998)(Correct)
Object oriented programming (OOP) methodology has gained widespread acceptance despite concerns
on slow execution. Object oriented languages typically use indirect function calls to implement
polymorp... / over an images. li Li is a Lisp interpreter written in C. The br XLISP is a small implementation of Lisp with object-oriented programming.
An Implementation of Distributed Mathematical Services - Hess, Jung, Kohlhase, Sorge (1998)(Correct)
Real-world applications of theorem proving require open and modern software environments
that enable modularization, distribution, inter-operability, networking, and coordination.
This paper describes... / system roughly MB of Common Lisp CLOS code for the main body in br on the presence of proprietary Lisp compilers or interpreters. This
Advanced Programming Techniques Using Scheme - Moreau, Ribbens, Gribomont (1998)(Correct)
this paper, we
describe an interactive reducer for lambda terms that combines
first-class continuations, macros, delay, and state. We also
describe the means by which we induce students to master
adva... / our courses on various dialects of Lisp and we are now using Scheme. br Halstead Jr. New Ideas in Parallel Lisp Language Design Implementation.
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
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
Macro Processing in Object-Oriented Languages - Shigeru Chiba (1998)(Correct)
There are a number of programmable macro systems such as Lisp's. While they can handle
complex program transformation, they still have difficulty in handling some kinds of transformation
typical in ob... / programmable macro systems such as Lisp's. While they can handle complex br of tokens. Other systems like Lisp's macro system deal with it as a
Adding the axioms to Axiom: Towards a system of automated reasoning.. - Poll, Thompson (1998)(Correct)
A number of combinations of theorem proving and computer algebra
systems have been proposed; in this paper we describe another,
namely a way to incorporate a logic in the computer algebra system
Axiom... / between multiple values a la LISP cross products and tuples. It is br many university undergraduate programmes and are used in support of both
Efficient Simulation of Formal Processor Models - Wilding, Greve, Hardin (1998)(Correct)
Computer systems under development are routinely modeled by simulators,
and formal verification can be integrated into conventional computer
system development by reasoning directly about such simulat... / of PVS functions into Common Lisp and preliminary results using a br relatively fast execution of its Lisp-like logic on constant terms.
What robots can do: Robot programs and effective achievability - Fangzhen Lin (1998)(Correct)
In this paper, we propose a definition of goal achievability: given a basic action theory
describing an initial state of the world and some primitive actions available to a
robot, including some actio... / in a traditional language like C or LISP. For one thing the primitive br is a proof that a simple robot programming language is universal in that
An Experimental Comparison of Genetic Programming and Inductive Logic .. - Lappoon Tang (1998)(Correct)
This paper experimentally compares three approaches to program
induction: inductive logic programming (ILP), genetic programming (GP),
and genetic logic programming (GLP) (a variant of GP for inducing... / in a functional language such as Lisp from input output pairs. Although br although they also represent simple Lisp programs they do not seem to be
Similarity Inheritance: A New Model of Inheritance for Spreadsheet.. - Djang, al. (1998)(Correct)
Although spreadsheets can be argued to be the most
widely-used visual programming languages (VPLs) today,
most are very limited compared to other VPLs,
supporting only a few built-in types and offerin... / created by other tools or written in Lisp. These approaches add some of the br programs without classes J. Lisp and Symbolic Computation
Non-Intrusive Object Introspection in C++: Architecture and.. - Chuang, Kuo, Wang (1998)(Correct)
We describe the design and implementation of system
architecture to support object introspection in C++.
In this system, information is collected by parsing class
declarations, and used to build a sup... / However several languages such as Lisp and Prolog do have limited br Many object-oriented programming languages such as CLOS
Semantics Modifiers: An Approach To Non-Standard Semantics Of.. - Abramov, Glück (1998)(Correct)
this paper, semantics modifiers exist for a wide class of computational
problems, including non-standard computation, program analysis and unknown SEMANTICS MODIFIERS:
AN APPROACH TO NON-STANDARD SEMA... / Sexpressions known from Lisp defined by the grammar D br To Non-Standard Semantics Of Programming Languages Sergei Abramov
Programming by Analogy: Retrieval, Mapping, Adaptation and.. - Schmid, Mercy, Wysotzki (1998)(Correct)
We present an approach to program reuse by analogical transfer based upon the notion of recursive program
schemes (RPSs). RPSs are representations which capture the structure of a program and are ex... / context of an intelligent tutor for LISP programming was developed by Weber br . P. D. Summers. A methodology for LISP program construction from
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
Query Deforestation - Grust, Scholl (1998)(Correct)
The construction of a declarative query engine for a DBMS includes the challenge of compiling algebraic queries into efficient execution plans that can be run on top of the persistent storage. This wo... / expressed in a limited subset of LISP were revealed unfolded with br of fusion rules for an imperative programming language in which plans had to
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
Pattern Matching for Program Generation: A User Manual - Biggerstaff (1998)(Correct)
The Anticipatory Optimization Generation (AOG) system is built to generate custom programs using largescale,
programmatic transformations (versus pure pattern-based transformations) that operate on Ab... / . . . The And Operator and Lisp br . Lisp Escapes
The Theory of Fexprs is Trivial - Wand (1998)(Correct)
We provide a very simple model of a reflective facility based on the pure -calculus,
and we show that its theory of contextual equivalence is trivial: two terms in the language are
contextually equ... / Lisp and Symbolic Computation br fully reflective languages e.g. -Lisp Brown have even higher
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
Programs that Model Themselves - Craig (1998)(Correct)
Work on reflection has frequently concentrated on programming languages
and operating systems. This work either involves the use of tower
reflection or meta-object protocols. The subject of this paper... / and was introduced in Smith's -LISP In tower reflection when a br MOPs were introduced for the Common Lisp object system CLOS in order
Practical Task-Oriented Parallelism for Gaussian Elimination in.. - Cooperman (1998)(Correct)
This paper discusses a methodology for easily and efficiently parallelizing
sequential algorithms in linear algebra using cost-effective networks of
workstations, where the algorithm lends itself to p... / software packages written for LISP and GAP Groups br itself to the twin goals of programming ease and run-time efficiency.
Lightweight Formal Methods For Computer Algebra Systems - Dunstan, Kelsey, Linton, Martin (1998)(Correct)
In this paper we demonstrate the use of formal methods
tools to provide a semantics for the type hierarchy of the
AXIOM computer algebra system, and a methodology for
Aldor program analysis and verifi... / libraries for AXIOM as well as LISP C and stand-alone executables for br commonly found in the functional programming world such as higher-order
Style Sheet Languages and Mathematical Material - Timoney (1998)(Correct)
In this paper, we rst survey some emerging technologies which
are related to mathematics and computing, especially to mathematical
communication via computer networks.
Before mathematics can be used ... / system which is based mostly on Lisp code. Many of these special-purpose br implementations of functional programming languages such as ML
A visualisation of polymorphic type checking - Jun, Michaelson (1998)(Correct)
The understanding of polymorphic typechecking and type errors is poorly supported by
contemporary functional language implementations. Here, a novel visualisation of functions
and their types is prese... / type in some languages for example LISP and C where the presence or br ML subset within a visual programming environment in which function
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
A Task Description Language for Robot Control - Simmons, Apfelbaum (1998)(Correct)
Robot systems must achieve high level goals while
remaining reactive to contingencies and new opportunities.
This typically requires robot systems to coordinate
concurrent activities, monitor the envi... / planner RAP uses a Lisp-based interpreter to manage a task br used by a planner and runs using a Lisp-based interpreter. PRS Procedural
Summary of Multiagent Planning Architecture - Wilkins, Myers, desJardins, Berry (1998)(Correct)
This paper describes at least two areas in which such exploration was undertaken. The
first is exploring alternative strategies for integrating planning and scheduling. We decompose
a DARPA/Rome Labor... / agents written in C CLISP and Java communicating with each br System With The Mpa Lisp Wrapper. Prs Is The Basis For
A framework for using multiple classifiers in a multiple-agent.. - Vuurpijl, Schomaker (1998)(Correct)
This paper describes a new framework using intelligent agents for pattern recognition. A
justification for using alternatives to current classifier systems is given. The use of the framework,
called i... / comprises communication and programming languages like KQML and br genetic algorithms and genetic programming The following
Sub-machine-code Genetic Programming - Poli, Langdon (1998)(Correct)
CPUs are often seen as sequential, however they have a high degree of internal
parallelism, typically operating on 32 or 64 bits simultaneously. This paper
explores the idea of exploiting this interna... / a number of tricks to speed up his Lisp GP implementation. However soon br go beyond the inefficiencies of the Lisp language and some GP
The Roles of Artificial Intelligence in Information Systems - Wiederhold (1998)(Correct)
By determining classes of information processing tasks which are suitable for
artificial intelligence approaches we outline an architectural structure for large
systems. In that structure processing m... / Practical implementations of lisp define the semantics of many br which made up the foundations of lisp in the early sixties. We are
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
Coca: A Debugger for C Based on Fine Grained Control Flow and Data.. - Ducassé (1998)(Correct)
We present Coca, an automated debugger for C, where the breakpoint mechanism
is based on events related to language constructs. Events have semantics whereas
source lines used by most debuggers do n... / know how to program new commands in Lisp. The proposed framework for C is br Key-words Software engineering Programming environment Automated
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
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
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
Foundations of Distributed Programming Languages - Sewell (1998)(Correct)
Machine
M
ß-LTS
testing
C
C behaviour
(idealised)
SOS C-behaviour
\Gamma l ` P
print!"Hello"
\Gamma! P
0
C
printh"Hello";ffli
\Gamma! C
0
SOS C-behaviour
\Gamma l ` P 6 \Gamma!
SOS in test... / beta reduction communication LISP ML Haskell etc. Pict ffl br Foundations of Distributed Programming Languages Peter Sewell
SYSGP - A C++ library of different GP variants - Brameier, Kantschik, Dittrich.. (1998)(Correct)
In recent years different variants of genetic programming (GP) have emerged all
following the basic idea of GP, the automatic evolution of computer programs. Today,
three basic forms of representation... / programming language like LISP The inner nodes of these trees br programming language like LISP A radical form of linear GP the
Normalization by evaluation - Berger, Eberl, Schwichtenberg (1998)(Correct)
We extend normalization by evaluation (first presented in
[4]) from the pure typed -calculus to general higher type term rewrite
systems. This work also gives a theoretical explanation of the normal... / of e.g. Scheme a pure Lisp dialect one obtains an amazingly br procedure of some functional programming language such as Scheme. For
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
XOTcl, an Object-Oriented Scripting Language - Neumann, Zdun (1998)(Correct)
This paper describes the object-oriented scripting language XOTCL and
provides introductory examples on its usage. XOTCL (Extended OTCL) is an extension
of MIT's OTCL [26]. OTCL implements dynamic a... / modeled after the Common Lisp Object System The XOTCL br G. Kiczales D.A. Moon Common Lisp Object System. In Common Lisp
Formal Analysis of a Space Craft Controller using SPIN - Havelund, Lowry, Penix (1998)(Correct)
This paper documents an application of the finite state
model checker SPIN to formally verify a multi--threaded
plan execution programming language. The plan execution
language is one component of NAS... / To A Multi-Threaded Common Lisp. A Total Of Errors Were In br To A Multi-Threaded Common Lisp. Esl Is Used To Program The Ra
Accepted for publication in Microprocessors and Microsystems. - Te Ms (1998)(Correct)
This paper focuses on another source of non-conventional cache misses that occur during
page clearing in a virtual memory system. In a virtual memory system, when a physical
page is remapped to a new ... / programming languages such as LISP make extensive use of the dynamic br heap allocation. Functional programming languages such as LISP make
An angry half-dozen - Wadler (1998)(Correct)
Hardware Limited and Harlequin both market
commercial ML compilers, each bootstrapped in ML.
In some corners, functional languages bear a reputation
for gross inefficiency, but this reputation is out ... / typed in the same sense as Lisp Scheme or Smalltalk which makes br of Standard ML. ACM Conference on Lisp and Functional Programming .
Design of Piit: an Aldor library to express parallel programs - Mannhart (1998)(Correct)
Niklaus Mannhart
Institute for Scientific Computing
ETH-Zentrum
CH-8092 Zurich, Switzerland
e-mail: mannhart@inf.ethz.ch
url: http://www.inf.ethz.ch/personal/mannhart
October 31, 1997
Abstract
We de... / constructs that hide low level programming details. In the talk we br level in order to hide low level programming details especially
A Precise Description of the ACL2 Logic - Kaufmann, Moore (1998)(Correct)
The ACL2 logic is a first-order, essentially quantifier-free logic of total recursive
functions providing mathematical induction and several extension principles,
including symbol package definition a... / Logic for Applicative Common Lisp and might have been abbreviated br . Connection with Common Lisp One force pushing ACL toward
Programming Connectors In an Open Language - Aßmann, Ludwig, Pfeifer (1998)(Correct)
Connectors can be programmed flexibly using an open language with a static meta-object protocol. Illustrated with an example from OpenJava, it is presented how such connectors insert communication cod... / connectors can be described in a lisp-like syntax enriched with some br Programming Connectors In an Open Language
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
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 satisfiability and dynamic programming to solve the E-Majsat
An ACL2 Proof of Write Invalidate Cache Coherence - Moore (1998)(Correct)
As a pedagogical exercise in ACL2, we formalize and prove
the correctness of a write invalidate cache scheme. In our formalization,
an arbitrary number of processors, each with its own local cache, ... / Logic for Applicative Common Lisp.The logic is both an applicative br of a subset of applicative Common Lisp. In addition ACL is the name we
Ontologies For Molecular Biology - Schulze-Kremer (1998)(Correct)
SOCIAL ACTIVITY
WORK ACTIVITY
OBJECT
MENTAL OBJECT
ABSTRACT OBJECT
REPRESENTATIONAL OBJECT
INTANGIBLE OBJECT
ENERGY
ENTROPY
FORCE
PHYSICAL OBJECT
MATERIAL
PLACE
SEPARABLE ENTITY
SOCIAL OBJEC... / accessible as HTML hypertext and Lisp code. Ontological entries in br without special computer programming background be able to cope
Implementation of Proof Search in the Imperative Programming Language .. - Christian Urban (1998)(Correct)
Automated proof search can be easily implemented in logic programming languages.
We demonstrate the technique of success continuations, which provides an equally
simple method for encoding proof sea... / a rather technical illustration in LISP. Later an excellent paper EP br Proof Search in the Imperative Programming Language Pizza Christian
Grammatical Evolution: A Steady State approach. - Ryan, O'Neill (1998)(Correct)
We describe a Genetic Algorithm
that can evolve complete programs. Using
a variable length linear genome to
govern the mapping of a Backus Naur
Form grammar definition to a program,
expressions and pr... / use. While Koza originally employed Lisp as his target language many br Koza's Koza Genetic Programming has enjoyed considerable
BioSim - A New Qualitative Simulation Environment for Molecular.. - Heidtke, Schulze-Kremer (1998)(Correct)
Traditionally, biochemical systems are modelled
using kinetics and differential equations
in a quantitative simulator. However, for many
biological processes detailed quantitative information
is not a... / and QPE are implemented in Common LISP and so are the models build for br pathway. We translated EcoCyc from Lisp into Prolog to obtain a relational
EaCL 1.0: An Easy Constraint Programming Language - Mills, Tsang, Williams, Ford, al. (1998)(Correct)
This technical report describes a new language for describing constraint satisfaction problems,
called EaCL. Traditional Constraint Programming Languages have been built on top of host
languages such ... / of host languages such as Prolog Lisp CThis means that the user must br e.g. Ce.g. ILOG solver Lisp e.g. PECOS or Prolog e.g.
A Preliminary Investigation of Evolution as a Form Design Strategy - O'Reilly, Ramachandran (1998)(Correct)
We describe the preliminary version of our investigative
software, GGE -- Generative Genetic Explorer,
in which genetic operations interact with AutoCAD
to generate novel 3D forms for the architect.
G... / GGE. GGE is actually implemented in LISP Steele Transformation br . Guy Steele. Common LISP the language. Digital Press
A Prettyprinter for the RAISE Specification Language - Hua (1998)(Correct)
A prettyprinter without losing comments for RSL is presented. The input to this prettyprinter
is the abstract syntax tree of the source code of RSL. It works in three phases: BOX generating,
Comments ... / such as for PASCAL Ada and LISP And several br D. Waters. User Format Control in a LISP Prettyprinter. ACM Trans. Prog.
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
Some Non-Traditional Approaches to Information Retrieval - Plaunt (1998)(Correct)
In this brief overview of the projects I've worked on, I'd like briefly to describe several
approaches to information retrieval which push on the traditional boundaries in various ways
in order to pro... / RA MICAS etc.right skill set Lisp AI techniques quick learner br experimentation. In Associations of Lisp Users Meeting and Workshop
Evolving SoccerBots: A Retrospective - Sean Luke (1998)(Correct)
In the RoboCup97 robot soccer tournament, we entered
a team of softbot programs whose player strategies
had been entirely learned by computer. Our team
beat other human-coded competitors and received ... / method which searches for good Lisp programs to solve some particular br to solve some particular problem. Lisp programs can be thought of as
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 and managing the heap for a programming language such as Lisp or Java.
Literate programming from Scheme to TEX - Queinnec (1998)(Correct)
This report describes a system that allows easy insertions of Scheme, Lisp (and now C (thanks to
Thierry Saura)), code towards T E X or SLaTeX[Sit91] files. The originality of LiSP2T E X is that it ex... / from Scheme to T E X LiSP T E X release Sep br allows easy insertions of Scheme Lisp and now C thanks to Thierry
LISP - a Language for Internet Scripting and Programming - Hickey, Norvig, Anderson (1998)(Correct)
In this paper we argue that LISP can provide a powerful tool for web programmers,
at both the novice and expert level, and that LISP has the potential to become
a language of choice for writing both c... / LISP -a Language for Internet br In this paper we argue that LISP can provide a powerful tool for web
A User's Manual for GNU Emacs' Web-mode - Motl, Childs (1998)(Correct)
This document is a companion to web-modeX.el, a collection of GNU Emacs Lisp functions
designed to customize GNU Emacs so that it is sensitive to a WEB document. It is assumed unknown A User's Manual ... / supports ELisp the version of Lisp that extensions to Emacs are br a collection of GNU Emacs Lisp functions designed to customize
An introduction to the theories of bulk data types - Dobson (1998)(Correct)
this paper is substantially that of [2], altered very slightly to take
account of the peculiarities of the word processor used to prepare this note.
3 unknown TallShiPP
An introduction to the theor... / form of cons-list found in Lisp ML and most other functional br algorithmics Meertens' name for programming as a mathematical activity is
Correct Programs without Proof? On Checker-Based Program Verification - Goerigk, Gaul, Zimmermann (1998)(Correct)
this paper, for many useful hints using the theorem prover ACL2,
for many suggestions, and in particular for suggesting and contributing to the
reflexive functions example. Thanks to Axel Dold, Vincen... / program verification for functional Lisp programs using the Boyer-Moore br mechanical program verification for Lisp programs to the Verifix and
FM0.9beta Users' Guide - Rodríguez-Aguilar.. (1998)(Correct)
Auction-based e-commerce is an increasingly interesting domain for developing
trading agents competing in multi-agent electronic markets.
We present a framework for defining trading scenarios based on... / templates written in Java C and Lisp accompanies this release in order br own agents in either Java C or Lisp. The templates' documented code
Composing Software Systems from Adaptable Software Components - Wpi-Cs-Tr- George (1998)(Correct)
The construction of software systems from pre-existing, independently developed software components
will only occur when application builders can adapt software components to suit their needs. Our
ADA... / These phases are similar to the Lisp advice facility described in br is independent of the particular programming language and architectural
How to solve the reuse problem? Functional programming - Wadler (1998)(Correct)
onal to n.
Another factor favoring reuse is that functional languages
tend to eschew side effects. The entire semantics
is laid bare by the interface to each function, nothing
is hidden in global var... / typed in the same sense as Lisp Scheme or Smalltalk which makes br the reuse problem Functional programming Philip Wadler Bell Labs
Some recent extensions of the LFG formalism and their application in.. - Jonas Kuhn (1998)(Correct)
to appear)
JK Blaubeuren, 4 May 1998 3
Background
ffl Project of parallel grammar development
-- Participants
Xerox Palo Alto Research Center (California, USA),
Xerox Research Centre Europe (Gren... / developing parsing algorithm of the LISP-based LFG Grammar Writer's br Applications of Constraint-Based Programming to Computational Linguistics
The use of RoboCup (soccer simulation) for an AI programming course - Coradeschi, Malec (1998)(Correct)
In this paper we present an AI programming organised around RoboCup:
a soccer simulation system. The course participants create a number of software
agents that form a team, and participate in a tou... / Programming read Common Lisp course. Credit for this course is br The fact that some of them used Lisp didn't make it easier. However
Ham-Alc - Haarslev, Möller, Turhan (1998)(Correct)
imes are currently not comparable with other systems
due to the lack of these techniques. The next major
release of HAM-ALC will also include facilities for selective
unfolding and model caching. The ... / Programming language Common Lisp compiled Availability The br backjumping see Programming language Common Lisp
Facilitating Community Awareness with Associative Representation - Takashi Hirata (1998)(Correct)
This paper describes information sharing in a community
using associative representation. The associative
representation links heterogeneous information
without defining the semantics strictly. We
lea... / interface agent Agent- html Lisp infomation filtering Agent br from Figure a one knows a programming of mobile agent well. Because
A Precise Version of the Time Hierarchy for Language - Ben-Amram (1998)(Correct)
This report repeats the proof of the hierarchy theorem for language I in
the paper [1] (henceforth the paper) in a sufficient level of detail that the
constants involved can be evaluated, resulting in... / carried out under the CMU Common Lisp system. The running time of a br The fact that I work with Common Lisp forced me to rename the atoms
Why no one uses functional languages - Wadler (1998)(Correct)
To say that no one uses functional languages is an exaggeration. Phone calls in the European Parliament are routed by programs written in Ericsson’s functional language Erlang. Virtual CDs are distrib... / Packagability Following the LISP tradition many functional br Sigplan Acm Functional Programming Why No One Uses Functional
A Bibliography of Publications about ANSI Standards for Programming.. - Beebe (1998)(Correct)
8.9> 1978 [Ame87b, AC87c].
1980 [AC87b]. 1981 [AC87a]. 1983 [AI83,
Ame83, Ame95a, UA83a, UA83b].
1985 [Ame85d, AC90b, AC90d].
1986 [Ame86]. 1987 [Ame87a, AC87a].
1988 [AC88a, AA88]. 1989 [AC89a, A... / Vil linguagem Cad LISP AC c AC d AI a Local br programming language Common LISP X . x Draft .
The Implementation of a Soccer Player - Broxvall (1998)(Correct)
This report discuss the final architecture
used in my implementation of
a team of soccer playing software agents.
Some similarities in terminology and idea
can be found with the architecture describ... / stated above to be called from a lisp system implementing the AI I br I have as a part of an AI programming course implemented a team of
Evolved Representations and Their Use in Computational Creativity - Schnier (1998)(Correct)
ii
1 Introduction 1
1.1 Goal of the Thesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.2 Organization of the Thesis . . . . . . . . . . . . . . . . . . . . . . . . 2
2 Background 4... / this thesis among others GNU Common Lisp and CMU Lisp LaTeX Xfig Xemacs br others GNU Common Lisp and CMU Lisp LaTeX Xfig Xemacs AucTeX
Asynchrony in parallel computing: From dataflow to multithreading - Silc, Robic, Ungerer (1997)(Correct)
The paper presents an overview of the parallel computing models, architectures, and research projects that are based on asynchronous instruction scheduling. It starts with pure dataflow computing mode... / Multilisp is an extension of the Lisp dialect Scheme with additional br Jr.Implementation of Multilisp Lisp on a multiprocessor in Proc. ACM
Programming in the Pi-Calculus: A Tutorial Introduction to Pict - Pierce (1997)(Correct)
Pict is a programming language in the ML tradition, formed by adding high-level derived forms
and a powerful static type system to a tiny core language. The core, Milner's pi-calculus, has been
used a... / ISWIM Lan and McCarthy's LISP McC The calculus br calculus to early dialects of LISP. The calculus in its present
Genetic Programming in Europe - Langdon, Poli (1997)(Correct)
this report
we describe the state of the art in GP technology, the role Europe has in advancing it and the activities
of the E v o
G
P
working group. We indicate the likely benefits of this technology... / fold speed ups in comparison with LISP are claimed. Later work NB b br Genetic Programming in Europe Report of the E v
Studies of Integration and Optimization of Interpreted and Compiled.. - Fox, Li, Wen, Zhang (1997)(Correct)
an view
our front end compiler as similar to the javac compiler's function of producing JavaVM
bytecodes. The II/CVM will naturally need the study of such issues as Just in Time compilation,
dynamic l... / by data parallel runtime in LISP on CM . Parallel computing research br also to produce more attractive programming environments. This proposal
A Syntactic Theory of Dynamic Binding - Moreau (1997)(Correct)
Dynamic binding, which has always been associated with Lisp, is still
semantically obscure to many. Although largely replaced by lexical scoping, not
only does dynamic binding remain an interesting ... / has always been associated with Lisp is still semantically obscure to br traditionally been associated with Lisp dialects. It appeared in
An Object-Oriented Functional Approach to Information Systems.. - Lee Braine (1997)(Correct)
This paper concentrates on the search for a programming
language and supporting theory which combines features from the objectoriented
and functional paradigms. The aim is to integrate the formal
me... / BKK involved the extension of LISP with object-oriented features. This br object-oriented programs in Common LISP Ste Significant claims have
Implementing Concurrent Logic and Functional Languages in Dactl - George Papadopoulos (1997)(Correct)
this paper we try to bridge the gap between
the two formalisms by showing how concurrent logic languages can be implemented using
graph rewriting. In particular, we develop techniques for mapping a wi... / languages such as HopeML Common Lisp Clean etc. can be easily mapped br of computation and higher order programming. Keywords Concurrent Logic
Executing Formal Specifications with Constraint Satisfaction - Wahls, Leavens, Baker (1997)(Correct)
We have implemented an execution technique for formal specifications, which is based on
constraint satisfaction techniques. These techniques allow one to execute model-based specifications
written at ... / calculus constraint logic programming C CR Categories br high-level languages D. . Programming Languages Processors -
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
Floating point verification in HOL Light: the exponential function - Harrison (1997)(Correct)
In that they often embody compact but mathematically sophisticated algorithms,
operations for computing the common transcendental functions in
floating point arithmetic seem good targets for formal ve... / its ancestors which are based on LISP or Standard ML. HOL Light is br expressed in a simple formalized programming language intended to be a
Evolution and Development of Modular Control Architectures for 1-D.. - Kodjabachian, Meyer (1997)(Correct)
An evolutionary approach is used to design neural control architectures
for six-legged animats. Using a geometry-oriented variation of
the cellular encoding scheme and syntactic constraints that reduc... / Augmented Finite State Machines Lisp-like programs or Classifier br genetic programming to evolve Lisp-like programs S-expressions The
Research Demonstration of a Hardware Reference-Counting Heap - Wise, Heck, Hess, Hunt, Ost (1997)(Correct)
A hardware self-managing heap memory (RCM) for languages like LISP, SMALLTALK, and JAVA has been designed,
built, tested and benchmarked. On every pointer write from the processor, reference-counting ... / Reference-Counting Heap LISP and Symbolic Computation br memory RCM for languages like LISP SMALLTALK and JAVA has been
An On-Line Method to Evolve Behavior and to Control a Miniature Robot .. - Nordin, Banzhaf (1997)(Correct)
We present a novel evolutionary approach to robotic control of a real
robot based on genetic programming (GP). Our approach uses genetic
programming techniques that manipulate machine code to evolve c... / is up to times faster than a LISP-based GP system and it has in br in an interpreted language like LISP Koza This reduces
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
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
Mobile Robotics 1997 - Jessica Bayliss (1997)(Correct)
After abandoning an attempt to build our own gasoline-powered automated outdoor vehicle
in 1995, we purchased two M68332-controlled wheelchairs for indoor and outdoor mobile
robotics research. Much of... / . The SDBus in LISP . br it is not needed. The SDBus in LISP The nature of information that