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.
16441.8 An Indexed Bibliography of Genetic Algorithms - Papers of 1992 - Alander (1996)(Correct)
s: Jan. 1993 -- Feb. 1995
ffl CCA: Computer & Control Abstracts: Jan. 1992 -- Mar. 1996 (except May-95)
ffl CTI: Current Technology Index Jan./Feb. 1993 -- Jan./Feb. 1994
ffl DAI: Dissertation Abst... / Germany gaGPbib.ps.Z genetic programming gaIMPLEbib.ps.Z br review genetic programming CAD robotics
16328.7 An Indexed Bibliography of Genetic Algorithms in United Kingdom - Alander (1996)(Correct)
s: Jan. 1993 -- Feb. 1995
ffl CCA: Computer & Control Abstracts: Jan. 1992 -- Mar. 1996 (except May-95)
ffl CTI: Current Technology Index Jan./Feb. 1993 -- Jan./Feb. 1994
ffl DAI: Dissertation Abst... / DDR gaGPbib.ps.Z genetic programming gaIMPLEbib.ps.Z br comparison hybrid genetic programming classifier systems
12028.9 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
11614.5 Data-parallel Implementation of Prolog - Bevemyr (1996)(Correct)
Bevemyr, J. 1996: Data-parallel Implementation of Prolog, Uppsala Theses in
Computing Science 25. 38 pp. Uppsala. ISSN 0283--359X, ISBN 91--506--1177--1.
Parallel computers are rarely used to make ind... / to a level comparable to LISP implementations. This br set of data similarly to mapcar in Lisp and DOALL in Fortran. Harrison
11585.2 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
10356.6 Implementation Issues for Reverse Hillclimbing - This(Correct)
subject of three output lines,
as it would be encountered during descents from 100, 010 and 001. The post-processor
sorted the output file by vertex identity and then collected the statistics for the... / Artificial Intelligence with Common Lisp. D. C. Heath Lexington MA . br J. R. Koza. Genetic Programming On the Programming of
9388.3 Incremental Computation: A Semantics-Based Systematic.. - Liu (1996)(Correct)
ion of a function f adds
an extra cache parameter to f . Simplification simplifies the definition of f given the
added cache parameter. However, as to how the cache parameter should be used in
the sim... / written in a standard language like Lisp. In general such programs are br to normal high-level languages like Lisp. Maintaining and strengthening
9309.8 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
8859.3 The ACCLAIM Project (PE7195) - Partners Swedish(Correct)
This project aims to further the conceptual, mathematical and practical
foundations for concurrent constraint programming, and in so doing, provide
a framework for, design and implement advanced compu... / and ill-parallelisable e.g.Lisp or well-understood but br programming such as most Lisps suffer from both the loss of
8851.4 Compilation Techniques for Prolog - Lindgren (1996)(Correct)
Lindgren, T. 1996: Compilation Techniques for Prolog, Uppsala Theses in Computing
Science 26. 36pp. Uppsala. ISSN 0283-359X, ISBN 91-506-1181-X.
Current Prolog compilers are largely limited to optimiz... / translation is similar to Scheme or Lisp translations discussed below but br Translations into Scheme and Lisp Several translations of Prolog
8141.7 Compiling Standard ML For Efficient Execution On Modern Machines - Shao (1994)(Correct)
Many language theoreticians have taken great efforts in designing higher-level programming
languages that are more elegant and more expressive than conventional languages. However,
few of these new la... / . . Lisp br languages such as Fortran and Lisp came into the programming world.
7540.4 An Indexed Bibliography of Genetic Algorithms - Papers of 1990 - Alander (1996)(Correct)
s: Jan. 1993 -- Feb. 1995
ffl CCA: Computer & Control Abstracts: Jan. 1992 -- Mar. 1996 (except May-95)
ffl CTI: Current Technology Index Jan./Feb. 1993 -- Jan./Feb. 1994
ffl DAI: Dissertation Abst... / Connection Machine LISP transputers br and Travis Kerzic. mGA . A Common lisp implementation of a messy genetic
7004.8 Polymorphic Type Inference and Semi-Unification - Henglein (1989)(Correct)
In the last ten years declaration-free programming languages with a polymorphic typing discipline (ML,
B) have been developed to approximate the flexibility and conciseness of dynamically typed langua... / of dynamically typed languages LISP SETL while retaining the safety br objects -at run-time e.g.LISP PROLOG APL others do it at
6628.8 The Evolution of Lisp - Steele, Jr., Gabriel (1993)(Correct)
Lisp is the world's greatest programming language---or so its proponents think. The
structure of Lisp makes it easy to extend the language or even to implement entirely new
dialects without starting f... / gls think.com The Evolution of Lisp Richard P. Gabriel Lucid Inc. br rpg lucid.com Abstract Lisp is the world's greatest programming
6566.4 Reflection and Hyper-Programming in Persistent Programming Systems - Kirby (1992)(Correct)
In an orthogonally persistent programming system, data is treated in a manner independent of its persistence. This gives simpler semantics, allows the programmer to ignore details of long-term data st... / . . . br below Brown is a variant of Lisp MAE It allows the definition
6343.8 Survey: Practical Applications of Constraint Programming - Wallace (1995)(Correct)
no abstract-- unknown Survey: Practical Applications of Constraint
Programming
Mark Wallace
IC-Parc, William Penney Laboratory,
Imperial College, LONDON SW7 2AZ.
email: mgw@doc.ic.ac.uk
September 1... / history yielding languages such as LISP Prolog and other purer functional br Wilson. Constraint hierarchies. Lisp and Symbolic Computation
6283.1 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
6112.0 1983-1993: The Wonder Years of Sequential Prolog Implementation - Van Roy (1993)(Correct)
This report surveys the major developments in sequential Prolog implementation during the
period 1983--1993. In this decade, implementation technology has matured to such a degree
that Prolog has left... / on PCs Arity LPA Delphia and on Lisp machines LMI Symbolics There is br It was competitive in performance to Lisp systems of the day and was for
6102.3 On the Integration of Concurrency, Distribution and Persistence - Munro (1993)(Correct)
The principal tenet of the persistence model is that it abstracts over all the
physical properties of data such as how long it is stored, where it is stored, how it
is stored, what form it is kept in ... / who is using it. Experience with programming systems which support br incorporated into the persistent programming system Napier . A detailed
5999.6 The Formal Relationship between Direct and Continuation-Passing Style .. - Sabry (1994)(Correct)
Compilers for higher-order programming languages like Scheme, ML, and Lisp can
be broadly characterized as either "direct compilers" or "continuation-passing style
(CPS) compilers", depending on their... / languages like Scheme ML and Lisp can be broadly characterized as br programming languages Scheme ML Lisp etc use a CPS intermediate
5920.3 Garbage Collecting The Internet - Abdullahi, Ringwood(Correct)
Distributed systems present a new challenge to garbage collection design. Garbage collection schemes
for linked, heterogeneous data-structures distributed over a network are reviewed for the first tim... / reclamation became a necessity when LISP pairs were introduced in the early br allocation routines e.g. CONS in Lisp perform special actions to reclaim
5904.5 Evolutionary Artificial Neural Networks - Yao (1993)(Correct)
Evolutionary artificial neural networks (EANNs) [1] result from combinations of artificial
neural networks (ANNs) and evolutionary search procedures such as genetic
algorithms (GAs). This article intr... / algorithms evolutionary programming and evolution strategies br Steerable genNets the genetic programming of steerable behaviors in
5748.3 Access-Limited Logic - A Language for Knowledge Representation - Crawford (1990)(Correct)
Access-Limited Logic (ALL) is a language for knowledge representation which formalizes the access
limitations inherent in a network structured knowledge-base. Where a deductive method such as
resoluti... / succeed. We have implemented ALL in Lisp and it has been used to build br Part one presents work on the Lisp implementation of ALL and its
5533.4 Partial Evaluation: Principles and Perspectives - Consel, Danvy (1993)(Correct)
The last years have witnessed a flurry of new results in
the area of partial evaluation. These tutorial notes survey
the field and present a critical assessment of the state of
the art.
1 Introduction... / languages e.g.format in Lisp and printf in C Figure br computation. In ACM Conference on Lisp and Functional Programming pages
5496.9 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
5034.6 Supporting Collaborative Design by Embedding Communication and.. - Reeves (1993)(Correct)
Although the computer has been viewed as an aid to communication and design, both in face-to-face
meetings and asynchronous interaction, collaborative design has proven difficult to support. Designers... / companion. He introduced me to the Lisp Machine and encouraged me to write. br me to write. Thanks to the Lisp gurus Andreas Lemke Andreas
4903.1 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
4903.0 An Object-Oriented Case-Based Learning System - Petrak (1995)(Correct)
This thesis first gives an overview of the subfield of classification in the area of machine learning. The numerous variants of Case-Based Learning algorithms are compared according to what kind of da... / ist eine modulare objektorientierte LISP Programmierumgebung in der eine br methods. A modular object-oriented LISP environment VIE-CBR is
4797.3 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
4668.8 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
4627.7 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
4410.3 Supporting the Restructuring of Data Abstractions through.. - Bowdidge (1995)(Correct)
ions
through Manipulation of a Program Visualization
A dissertation submitted in partial satisfaction of the
requirements for the degree Doctor of Philosophy
in Computer Science
by
Robert William Bowd... / it. When programming in Scheme and Lisp asterisks around a variable name br experience UNIX experience and Lisp experience including classroom
4353.5 The Boyer-Moore Theorem Prover and Its Interactive Enhancement - Boyer, Kaufmann, Moore (1995)(Correct)
The so-called "Boyer-Moore Theorem Prover" (otherwise known
as "Nqthm") has been used to perform a variety of verification tasks for two
decades. We give an overview of both this system and an inter... / seminal papers on the logic of Lisp including McC b McC b and br free logics for arithmetic. Since Lisp may be viewed simultaneously as a
4345.6 Types and Polymorphism in Persistent Programming Systems - Connor (1990)(Correct)
In a type secure persistent programming system, all data is governed for its entire
lifetime by a single type system. The universality of the persistent type system has
implications in terms of both t... / In contrast languages such as Lisp McC use a dynamic binding br and that of a language such as Lisp is that Napier 's binding is
4324.4 Language and Compiler Issues in Scalable High Performance Scientific.. - Johnsson (1992)(Correct)
Library functions for scalable architectures must be designed to correctly and efficiently
support any distributed data structure that can be created with the supported languages
and associated compil... / from all supported languages Lisp C CM-Fortran and Paris br Set in combination with Lisp C and Fortran Single library
4213.2 Toward A Foundation of Disjunctive Logic Programming - Minker (1989)(Correct)
I provide a personal memoir on work that I have done and describe research
that influenced my work that led to results in the foundation of disjunctive
logic programming. I discuss my beginning experi... / logic programming competitive with LISP and conventional programming br and its implementation compared with lisp. In Proc. Symp. on AI and
4200.6 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
4180.2 Cooperative - Competitive Genetic Evolution of Radial Basis Function.. - Whitehead, Choate (1995)(Correct)
In a radial basis function (RBF) network, the
RBF centers and widths can be evolved by a cooperativecompetitive
genetic algorithm. The set of genetic strings
in one generation of the algorithm represe... / or evolutionary programming EP algorithm. br . H. de Garis Genetic programming Building artificial nervous
4084.6 Therapy Plan Generation in Complex Dynamic Environments - Arnold, Jantke (1994)(Correct)
There has been developed a methodology for the automatic synthesis of therapy plans
for complex dynamic systems. An algorithm has been implemented and testet. This is
the core of some control synthesi... / to those synthesizing LISP expressions or Prolog programs br planning algorithm is implemented in LISP and running under SUN OS on Sparc
4054.7 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
3993.9 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
3973.4 Rule-Based Program Restructuring For High Performance Parallel.. - Tenny (1992)(Correct)
Writing good programs for high performance parallel computers is difficult. The
programmer must have a deep understanding of the underlying machine architecture.
Issues such as memory hierarchy, commu... / source code of a crude Common Lisp port. Tragically a caving br computers is difficult. The programmer must have a deep understanding
3940.1 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.
3913.7 Design and implementation of 81/2, a declarative data-parallel.. - Michel (1994)(Correct)
Une pr'esentation de 81/2, un langage exp'erimental combinant les avantages des langages `a collections
et `a flots de donn'ee dans un cadre d'eclaratif est donn'ee. Une nouvelle structure, le tissu e... / SDDS or in Jay list in LISP tuple in SQL pvar in LISP br LISP tuple in SQL pvar in LISP Thi or even finite discrete
3899.5 A Theorem Prover for a Computational Logic - Boyer, Moore (1990)(Correct)
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely
generated objects including the integers, ordered pairs, and symbols. The prover, known both
as NQTHM and... / a subset of applicative Common Lisp. In the subsequent discussion we br of our logic is close to that of Lisp. In fact from the time we started
3860.6 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
3822.7 Delivering the Benefits of Persistence to System Construction and.. - Cutts (1992)(Correct)
In an orthogonally persistent programming system the longevity of data is independent
of its other attributes. The advantages of persistence may be seen primarily in the
areas of data modelling and pr... / the spectrum are languages such as Lisp and Smalltalk MAE GR in br new architecture dynamic linking Lisp Smalltalk Figure . A
3768.1 Planning-Based Control of Software Agents - Weld (1996)(Correct)
this paper is not intended to be a
comprehensive survey of important softbot projects ---
there are far too many interesting systems for me to
describe them all. I focus on University of Washington
pr... / information on acquiring the Common Lisp source code see br uses principles from logic programming Jaffar et al. and
3713.4 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
3657.1 A Study of Compile-time Metaobject Protocol - Chiba (1996)(Correct)
C++ cannot be used to implement control/data abstractions as a library
if their implementations require specialized code for each user code. This
problem limits programmers to write libraries in two w... / for Processing a Program . Lisp Macros . br . . -Lisp .
3647.2 Collection Schemes For Distributed Garbage - Abdullahi, Miranda, Ringwoo (1992)(Correct)
With the continued growth in interest in distributed
systems, garbage collection is actively receiving attention by
designers of distributed languages [Bal, 1990]. Distribution adds
another dimensio... / garbage Krasner For Lisp collection overheads of between br references. Clark's measurements of LISP programs see Deutsch and Bobrow
3604.3 Introducing ASF+SDF Using the $\lambda$-calculus as Example - van Deursen (1994)(Correct)
This document aims at providing a gentle introduction to the use of ASF+SDF . Asf+Sdf unknown Introducing ASF+SDF
Using the -calculus as Example
Arie van Deursen
CWI -- P.O. Box 94079, 1090 GB Amste... / definition of the calculus and a Lisp implementation allowing e.g. br the calculus. Using AsfSdf no Lisp implementation is needed the
3562.4 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
3535.7 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
3488.8 A Paradigm for Decentralized Process Modeling and its Realization in.. - Ben-Shaul (1995)(Correct)
A Paradigm for Decentralized Process Modeling
and its Realization in the
Oz Environment
Israel Z. Ben-Shaul
This dissertation investigates decentralization of software processes and Process Center... / PCEs include Arcadia Common Lisp Framework CLF Melmac br for the endless discussions long programming nights and for reviewing the
3486.0 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
3472.6 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 .
3463.9 Data-Structural Bootstrapping And Catenable Deques - Buchsbaum (1993)(Correct)
The list is a fundamental data structure. It stores a linearly ordered collection of
elements and allows access only to the front and rear elements of the list. Catenation
can be applied to lists, un... / programming languages such as LISP ML and Scheme. Actual br programming languages such as LISP ML and Scheme Set in which
3447.8 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
3438.4 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
3351.8 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
3333.3 A First Order Logic of Effects - Mason (1996)(Correct)
In this paper we describe some of our progress towards an operational implementation of a modern programming
logic. The logic is inspired by the variable type systems of Feferman, and is designed for ... / atomic data A such as the Lisp booleans t and nil and in br The Semantics of Destructive Lisp. PhD thesis Stanford University
3277.1 Lively Linear Lisp - 'Look Ma, No Garbage!' - Baker (1992)(Correct)
Linear logic has been proposed as one solution to the problem of garbage collection and providing efficient "updatein
-place" capabilities within a more functional language. Linear logic conserves acc... / Corporation Lively Linear Lisp -Look Ma No Garbage br of linear logic called Linear Lisp that runs within a constant factor
3254.6 A Syntactic Theory of Dynamic Binding - Moreau (1996)(Correct)
Dynamic binding, which traditionally has always been associated with Lisp, is still
semantically obscure to many. Even though most programming languages favour lexical scope,
not only does dynamic b... / has always been associated with Lisp is still semantically obscure to br traditionally been associated with Lisp. It appeared in McCarthy s Lisp
3250.2 Constraint Logic Programming - Rossi(Correct)
Constraint logic programming (CLP) is a research area which can be located between artificial intelligence,
operation research, and programming languages, and has to do with modeling, solving,
and pro... / Constraint Logic Programming Francesca Rossi br Abstract Constraint logic programming CLP is a research area which
3238.2 A Concurrent, Distributed Model for Hypermedia-based Information.. - Dattolo, Loia(Correct)
The market for parallel and distributed computing systems keeps growing.
Technological advances in processor power, networking, telecommunication and
multimedia are stimulating the development of appl... / K.Lamott O. Common Lisp User Interface Environment. br concurrent distributed programming. This work proposes a new
3229.6 Mutable Object State for Object-Oriented Logic Programming: A Survey - Alexiev (1993)(Correct)
One of the most difficult problems on the way to an integration of Object-Oriented and Logic
Programming is the modeling of changeable object state (i.e. object dynamics) in a particular logic
in orde... / State for Object-Oriented Logic Programming A Survey Technical Report br of Object-Oriented and Logic Programming is the modeling of changeable
3209.1 Fixed Points and Extensionality in Typed Functional Programming.. - Howard (1992)(Correct)
We consider the interaction of recursion with extensional data types in several typed functional programming
languages based on the simply-typed lambda calculus. Our main results concern the relation ... / at the ACM Conference on Lisp and Functional Programming br of PCF. In ACM Conference on Lisp and Functional Programming pages
3206.9 Viewing A Program Transformation System At Work - Paige (1994)(Correct)
How to decrease labor and improve reliability in the development of efficient implementations
of nonnumerical algorithms and labor intensive software is an increasingly important problem as
the demand... / that occur at program points and lisp-like s-expressions a general br Stream Processing ACM Symposium on LISP and Functional Programming pp.
3204.3 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
3159.7 tcc: A System for Fast, Flexible, and High-level Dynamic Code.. - Poletto, Engler, Kaashoek (1997)(Correct)
tcc is a compiler that provides efficient and high-level access to
dynamic code generation. It implements the `C ("Tick-C") programming
language, an extension of ANSI C that supports dynamic code
gene... / Many languages such as most Lisp dialects Tcl and br . G.L. Steele Jr. Common Lisp. Digital Press second edition
3130.6 A General, Grain-Size Adaptable, Object-Oriented Programming Language .. - Andersen (1992)(Correct)
A general machine independent language for parallel programming is strongly
needed. In this dissertation a general object-oriented programming language, Ellie,
for machine independent programming of d... / is not strongly typed e.g.LISP then actions must often be taken br meant as a high level language. The LISP based object-oriented Actor
3127.8 A simulation substrate for real- time planning - Anderson (1995)(Correct)
Real-time planning is, generally speaking, problem-solving under time-pressure. In order to test and evaluate real-time planners, scientists need to have environments that pose problems to be solved. ... / taught me to play bridge and code Lisp. David Westbrook took over Phoenix br agents. TCL is very nearly Common Lisp augmented by functions for
3116.2 Reflexive Interpreters - Doyle (1978)(Correct)
The goal of achieving powerful problem solving capabilities leads to the "advice taker"
form of program and the associated problem of control. This proposal outlines an approach
to this problem based ... / first-order logic Brown and LISP . McCarthy et al br The basic types of descriptions in LISP are those of CONS cells which have
3064.7 Systematic Derivation of Incremental Programs - Yanhong Liu (1995)(Correct)
A systematic approach is given for deriving incremental programs from non-incremental programs
written in a standard functional programming language. We exploit a number of program analysis
and transf... / written in a standard language like Lisp. Our work attacks the problem of br written in a standard language like Lisp. In general such programs are
3049.9 Exploiting Program Schemata in a Prolog Tutoring System - Gegg-Harrison (1993)(Correct)
After their beginnings in computer-aided instruction, automated tutors have re-emerged as
intelligent tutoring systems. These intelligent tutors have obtained considerable success by using
results fro... / Debugging . . LAURA . . Lisp Tutor vi . . PROUST br language. With the exception of the LISP Tutor Anderson Reiser
3046.6 A Debugger for Standard ML - Tolmach, Appel (1993)(Correct)
We have built a portable, instrumentation-based, replay debugger for the Standard ML of
New Jersey compiler. Traditional "source-level" debuggers for compiled languages actually
operate at machine lev... / of the ACM Conference on Lisp and Functional Programming Nice br cost in added execution time. Many Lisp systems have powerful and elaborate
3027.8 Reflection in logic, functional and object-oriented programming: a.. - Demers, Malenfant(Correct)
Reflection is a wide-ranging concept that has been studied
independently in many different areas of science in general,
and computer science in particular. Even in the sub-area
of programming language... / he developed two languages -Lisp and -Lisp. Although Smith gave br two languages -Lisp and -Lisp. Although Smith gave much more
3018.6 MetaML: Multi-Stage Programming with Explicit Annotations - Taha, Sheard(Correct)
We introduce MetaML, a practically-motivated, staticallytyped
multi-stage programming language. MetaML allows
the programmer to construct, combine, and execute code
fragments in a type-safe manner. Co... / static-typing. Relationship to LISP MetaML has three annotations br and Run that are analogous to LISP's back-quote comma and eval
2981.8 NESL: A Nested Data-Parallel Language (Version 3.1) - Blelloch (1995)(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 computers, and ... / data-parallel languages C Lisp and Fortran with br The languages Connection Machine Lisp and Paralation Lisp both
2981.3 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
2970.9 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
2958.0 A Recursion Parallel Prolog Engine - Bevemyr (1993)(Correct)
We present the design and implementation of a recursion parallel Prolog engine
based on the Reform execution model. This is a data-parallel approach to parallelizing
Prolog on MIMD machines. The imple... / in the structure e.g.C and LISP. All attempts so far to br be explicitly controlled by the programmer e.g.by using monitors
2927.0 Combining Genetic Algorithms and Neural Networks: The Encoding Problem - Koehn (1994)(Correct)
Neural networks and genetic algorithms demonstrate powerful problem
solving ability. They are based on quite simple principles, but take advantage
of their mathematical nature: non-linear iteration.
N... / D Tree Representation LISP S-Expression D D . br has been implemented using the programming language CIts basic
2919.4 Semantics and compilation of sequential streams into a static SIMD.. - De Vito (1996)(Correct)
81/2 is a data-parallel language that relies on the notions of stream and collection in a
high-level declarative framework. We describe in this research report semantics and compilation
of sequential ... / in the SIMD execution model C LISP Fortran Control br structures like in Pomp-C or LISP To get an evaluation of the
2886.3 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
2866.5 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
2855.6 Inductive Program Synthesis for Therapy Plan Generation - Arnold, Jantke (1996)(Correct)
Planning is investigated in an area where classical Strips-
like approaches usually fail. The application domain is therapy (i.e. repair)
for complex dynamic processes. The peculiarities of this do... / are successfully implemented in Lisp and Prolog. The work has br core algorithm is implemented in LISP and running under SUN OS on Sparc
2818.7 Infinitary Self Reference in Learning Theory - Case (1994)(Correct)
Kleene's Second Recursion Theorem provides a means for transforming any program p into a
program e(p) which first creates a quiescent self copy and then runs p on that self copy together
with any exte... / those based on Turing machines Lisp Pascal are essentially br denotes a fixed acceptable programming system for the partial
2801.5 Audio System For Technical Readings - Raman (1994)(Correct)
o spent a great deal of time as his first reader/tutor.
Three years later, in 1982, he learned Braille. No Braille textbooks were available,
however, so the only source of reading material was his own... / me to implement my system in Lisp-CLOS. Bruce Donald and CSRVL br mathematics helped improve my Lisp programming skills and also
2791.8 Parallel Processing for Volume Visualization - Silva (1992)(Correct)
This paper describes the attempts for fast volume visualization using current commercial
and research parallel computers. Several parallel volume rendering algorithms are described
together with their... / the Connection Machine. Among these LISP and C have been extended to LISP br LISP and C have been extended to LISP and C which allow parallel
2785.1 Introducing CLOVER: an Object-Oriented Functional Language - Lee Braine (1996)(Correct)
The search for a language which combines both functional
and object-oriented features has a long and distinguished history [Can82,
Car84, BK86, BD88, BGW91, MHH91, AP93, CL91, MMH91, Sar93,
CL96]. T... / BK involved the extension of LISP with object-oriented features. This br object-oriented programs in Common LISP Ste Significant claims have
2780.3 An Overview of the CAPITL Software Development Environment - Adams, Solomon (1995)(Correct)
The CAPITL programming environment is comprised of a
shared, object-oriented, versioned database, an embedded logic-based
data-manipulation language, and a graphical user interface. With each
softwa... / . Term Space As in Prolog and LISP POL uses one data structure for br Abstract. The CAPITL programming environment is comprised of a
2767.2 /2: Data-Parallelism and Data-Flow - Olivier Michel (1996)(Correct)
We advocate a data-flow approach to data-parallelism to ensure both parallelism
expressiveness and efficient exploitation of data-parallel applications on
new massively parallel architectures. The rat... / Occam Collection Gamma APL LISP HPF CMFortran multi- br like APL SETL Lisp intensional languages etc.
2713.1 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
2694.3 The Nimble Type Inferencer for Common Lisp-84 - Baker (1990)(Correct)
data types model the semantic intent of the programmer
with respect to individual variable values, so that global properties of these individual values (e.g., evenness or
primeness of an integer valu... / Nimble Type Inferencer for Common Lisp- - Nimble Computer br Nimble Type Inferencer for Common Lisp- HENRY G. BAKER Nimble
2686.9 Evolution and Development of Neural Networks Controlling Locomotion.. - Jerome Kodjabachian (1997)(Correct)
This paper describes how the SGOCE paradigm has been
used to evolve developmental programs capable of generating neural networks
that control the behavior of simulated insects. This paradigm is charac... / of an animat -e.g.Lisp functions logic trees br Leaky Integrators Genetic Programming Animats. I. INTRODUCTION
2683.3 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
2683.1 Efficient Implementation of Unification-Based Grammars - Wintner, Francez (1999)(Correct)
Contemporary linguistic formalisms such as LFG or HPSG have become so rigorous that it is now
possible to view them as very high level declarative programming languages. Consequently, grammars
for na... / LFG which translates the grammar to Lisp or Profit which compiles br as very high level declarative programming languages. Consequently
2668.0 NESL: A Nested Data-Parallel Language (Version 2.6) - Blelloch (1993)(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, ... / has an ML-like syntax instead of a lisp-like syntax and includes support br serial access such as lists in Lisp or ML. Nesl is the first
2665.6 Programming a Pipelined Image Processor - Olson, Taylor, Lockwood (1993)(Correct)
Real-time computer vision systems often make use of dedicated image processing hardware to
perform the pixel-oriented operations typical of early vision. This type of hardware is notoriously
difficult... / interpreted language such as LISP or tcl analysis br Programming a Pipelined Image Processor
2658.6 Application Generators - Smaragdakis, Batory(Correct)
Introduction
When a programming activity is well-understood, it can be automated. Automation transforms software development from
activities like rote coding and tedious debugging to that of specific... / are implemented as extensions of the Lisp language or its variants. Lisp br Lisp language or its variants. Lisp has explicit syntax mapping
2639.8 Termination Of Non-Simple Rewrite Systems - Hoot (1996)(Correct)
this paper is whether one must require that the
component orderings be well-quasi-orderings (i.e., whether Theorem 3 (Special Termination) in
the [DH95] is in fact true, if not proven so.) While this ... / interface to code written in common lisp which implements the well-quasi br was developed in Macintosh Common Lisp and just uses functions special
2631.1 A theory of mixin modules: basic and derived operators - Ancona, Zucca (1996)(Correct)
Mixins are modules in which some components are deferred , i.e. their definition has to
be provided by another module. Moreover, differently from parameterized modules (like ML
functors), mixin module... / this name was firstly used in the LISP community see At the br name mixin was firstly used in the LISP community anyway the
2610.7 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
2587.9 Load Balancing Using Time Series Analysis For Soft Real Time Systems.. - Hailperin (1993)(Correct)
This thesis provides design and analysis of techniques for global load balancing on
ensemble architectures running soft-real-time object-oriented applications with statistically
periodic loads. It foc... / difficulties. Rich Acuff performed lisp machine miracles on a routine br object-oriented extension to the LISP programming language. A LAMINA
2581.8 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
2578.6 Efficient Computation of Fixpoints that Arise in Complex Program.. - Li-Ling Chen(Correct)
This paper proposes a model for studying the computation of fixpoints that arise in complex
program analysis based on abstract interpretation, and presents an efficient algorithm
for computing fixpoin... / in C and lambda expressions in Lisp it is not always possible to br of scheme programs. Lisp and Symbolic Computation An
2567.7 Some Mathematical Aspects of Information Technology: Fixed Points and .. - Seda (1996)(Correct)
this article. On the other hand, many
others are not mentioned at all, and there is indeed an immense literature covering the
various topics of which our bibliography is but a tiny fraction.
Devising ... / Inventor of the programming language Lisp and pioneer of AI. Much of the br and the Formal Semantics of Programming Languages Anthony Karel
2565.6 Deriving Incremental Programs - Yanhong Liu (1993)(Correct)
A systematic stepwise transformational approach is given for deriving incremental programs
from non-incremental programs. We exploit partial evaluation, other static analysis and transformation
techni... / programming language like Pascal or Lisp. Our work is closest in spirit to br written in a standard language like Lisp. In general such programs are
2564.2 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
2563.1 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
2562.9 The Basis for Mediation - Wiederhold, Genesereth (1995)(Correct)
Mediator modules provide intermediary services in information systems, linking data resources and
application programs. Programs that led to the concept of mediation were either constructed to
support... / programmed in languages as lisp. If optimization is crucial to br automatic code generation since programming knowledge is necessary to
2545.0 Personal Distributed Computing: The Alto and Ethernet Software - Lampson (1988)(Correct)
html.
Personal Distributed Computing: The Alto and Ethernet Software 2
display that looks something like an ordinary sheet of paper. He demonstrated this system at the
1968 Fall Joint Computer Con... / facilities like the Unix shell or M-Lisp in EMACS. The same mistake was made br size and slow speed. A full-scale Lisp Personal Distributed Computing
2501.5 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
2482.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
2476.2 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
2474.6 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
2469.1 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
2468.0 Design and implementation of 8 1/2 , a declarative data-parallel.. - Michel (1996)(Correct)
In this article we advocate a declarative approach to data-parallelism to provide both parallelism
expressiveness and efficient execution of data intensive applications. 81/2, an experimental
language... / Pascal Occam Collection Gamma LISP HPF CMFortran multi- br of that kind are APL SETL SQL Lisp C ffl Scalar languages
2458.7 Optimizing ML with Run-Time Code Generation - Lee(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... / be dynamically linked and executed. Lisp systems have long provided br can specify the construction of Lisp terms at the source level rather
2457.6 Collaborative Version Control in an Agent-Based Hypertext Environment - Dattolo, Loia (1996)(Correct)
In this work we discuss a number of issues for the design of hypertext systems in an
agent-basedmodel of computation. We examine how the "traditional" fundamental concepts which are
at the basis of th... / realized on the top of the Common Lisp Object System. Key words br Collaborative Work Common Lisp Object System. . INTRODUCTION
2454.4 State in Haskell - Launchbury, Jones (1996)(Correct)
Some algorithms make critical internal use of updatable state, even though their
external specification is purely functional. Based on earlier work on monads, we present a way of
securely encapsulat... / programming in ACM Conference on Lisp and Functional Programming MIT br in ACM Symposium on Lisp and Functional Programming
2452.5 Reengineering Unification And T-Entailment For Mantra In C++ - Kharma (1996)(Correct)
Reengineering Unification and t-Entailment for Mantra in C++
Tania Kharma
The objective of this thesis lies in two directions. In one hand, understanding the
concepts of unification and decidable inf... / in its previous version in Common Lisp in . On the other hand br it uses are not dependent on any programming language. The selection of OMT
2446.0 Higher Order Functions Considered Unnecessary for Higher Order.. - Goguen (1990)(Correct)
It is often claimed that the essence of functional programming is the use of functions as values,
i.e., of higher order functions, and many interesting examples have been given showing the power
of th... / was developed using Kyoto Common Lisp by Joseph Goguen Jos'e Meseguer br of Milan and a Franz Lisp OBJ from Washington State
2445.5 A note on Data-Parallelism and (And-Parallel) Prolog (Extended.. - Hermenegildo, Carro(Correct)
Introduction
The term data parallelism is generally used to refer to a parallel semantics for (definite) iteration in a
programming language such that all iterations are performed simultaneously, syn... / C Data Parallel C LISP etc. Recently much progress br Cambridge Mass. The Essential LISP Manual . Thinking
2440.6 IBM Research Report - Efficient Flow-Insensitive(Correct)
Data-flow analysis computes information about the potential behavior of a program in terms
of the definitions and uses of data objects. Data-flow analysis for programs written in languages
such as FOR... / for languages such as C CLISP and Fortran . Data-flow br structures such as C CLISP and Fortran has been less
2422.7 Opportunities for Online Partial Evaluation - Ruf, Weise (1992)(Correct)
Partial evaluators can be separated into two classes: offline specializers, which make all of
their reduce/residualize decisions before specialization, and online specializers, which make
such decisio... / useful only in programs exhibiting Lisp hacker programming style and br of the ACM Conference on Lisp and Functional Programming Nice
2422.6 Reflections on Standard ML - MacQueen (1994)(Correct)
Standard ML is one of a number of new programming languages developed in the 1980s that are seen as suitable vehicles for serious systems and applications programming. It offers an excellent ratio of ... / of dynamically typed languages like Lisp. It is also has the most br LCF itself was implemented in Lisp These roles can be separated in
2420.9 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
2396.9 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
2382.1 Partial Evaluation and the Generation of Program Generators - Jones (1993)(Correct)
this article: unknown Partial Evaluation and the Generation of
Program Generators
Neil D. Jones
DIKU, Department of Computer Science, University of Copenhagen
Universitetsparken 1, DK-2100 Copenhagen... / suitable choice of D is the set of Lisp's list data as defined by D br list data as defined by D LispAtom D e.g.
2381.7 TS/Scheme: Distributed Data Structures in Lisp - Jagannathan (1994)(Correct)
We describe a parallel object-oriented dialect of Scheme called ts/scheme that provides a simple
and expressive interface for building asynchronous parallel programs. The main component in ts/scheme... / Lisp And Symbolic Computation An br Distributed Data Structures In Lisp Suresh Jagannathan
2372.8 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
2372.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.
2358.2 A Library of High Level Control Operators - Queinnec (1993)(Correct)
Numerous high-level control operators, with various properties, exist in the literature. To understand
or compare them is difficult since their definitions use quite different theoretical frameworks; ... / queinnec Exp Submitted to Lisp Pointers. y Laboratoire br and automatically extracted using LiSP T E X. See the Scheme Repository
2355.1 Component-Object Interoperability In A Heterogeneous Distributed.. - Maybee (1995)(Correct)
Virtual
Window
System
Chiron Server
Chiron Server Chiron Client
Chiron Client
Concrete
Depiction
Artist
Artist
Dispatcher
Artist
ADT
Wrapper
ADT
Wrapper
ADT
Text
Text
Text
Wrapper
Artist
Applic... / of interfaces between C Common Lisp Ada and Pascal. The Matchmaker br languages include Ada C CLisp and Prolog. Much of the discussion
2343.1 DTRE - A Semi-Automatic Transformation System - Blaine, Goldberg (1991)(Correct)
This paper describes the theoretical framework and an implemented system (Dtre) for
the specification and verified refinement of specifications using operations on abstract
data types. The system is s... / programming languages like Common Lisp C or Ada. The system is also br interprets the integers in Common Lisp integers. The interpretations of
2338.9 Pseudoknot: a Float-Intensive Benchmark for Functional Compilers - Hartel, Feeley, Alt, Augustsson..(Correct)
Over 20 implementations of different functional languages are compared using one program. Aspects
studied are compile time and execution time. Another important point is how the program can
be modifie... / Compilers that generate C or Lisp are much slower than those that br lazy higher pattern pure Common Lisp dynamic eager higer access
2338.0 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
2336.9 An Empirical and Analytic Study of Stack vs. Heap Cost for Languages.. - Appel, Shao (1994)(Correct)
It has been proposed that allocating procedure
activation records on a garbage collected
heap is more efficient than stack allocation.
However, previous comparisons of heap vs.
stack allocation have ... / in continuation-passing style. Lisp and Symbolic br and stale binding problems of LISP . . unpublished undistributed
2331.9 The Polylith Software Bus - James Purtilo (1991)(Correct)
We describe a system called Polylith that helps programmers prepare and interconnect mixed-language
software components for execution in heterogeneous environments. Polylith's principal benefit is tha... / have been implemented by either the Lisp code shown in Figure or the Ada br for interactive languages such as Lisp the language environment also
2330.4 Implementing N-body algorithms efficiently in data parallel languages .. - Hu, Johnsson (1994)(Correct)
O(N ) algorithms for N --body simulations enable the simulation of particle systems with up to
100 million particles on current Massively Parallel Processors (MPPs). Our optimization techniques
mainly... / node KSR- Zhao-Johnsson Lispassembly node k CM- br to the Journal of Scientific Programming. Implementing O N N
2328.4 Internal Reinforcement in a Connectionist Genetic Programming Approach - Teller, Veloso(Correct)
Genetic programming (GP) is a successful machine learning technique that provides
powerful parameterized program primitive constructs using evolution as its search
mechanism. However, unlike some mach... / by which individuals e.g.Lisp programs in the case of GP can be br in a Connectionist Genetic Programming Approach Astro Teller
2328.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
2308.5 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
2298.4 Extensible Denotational Language Specifications - Cartwright, Felleisen (1994)(Correct)
Traditional denotational semantics assigns radically different
meanings to one and the same phrase depending on the rest of the
programming language. If the language is purely functional, the denota... / language like Scheme Common LISP or ML consists of a br L.G. Overview The Common Lisp Object System. Lisp and Symbolic
2289.0 Eta-Expansion does the Trick - Danvy, Malmkjær, Palsberg (1996)(Correct)
ion theorem in the first-order
case [Holst and Hughes 1990; Reynolds 1983; Wadler 1989]. The composition of
specialization and list lookup is replaced by the composition of lookup and map of
specializ... / to this value at run time. In Lisp residualizing a static value br of the ACM Conference on Lisp and Functional Programming W.
2283.4 Computational Genetics, Physiology, Metabolism, Neural Systems.. - Yeager(Correct)
This paper discusses a computer model of living organisms and the ecology they exist in called
PolyWorld. PolyWorld attempts to bring together all the principle components of real living systems
into ... / has developed a system for evolving LISP functions that he terms Genetic br phenomena without their being programmed in To createartificial
2281.5 OZ: A Decentralized Process Centered Environment - Ben-Shaul (1993)(Correct)
This is a proposal for a model and an architecture for decentralized process centered
environments, supporting collaboration and concerted efforts among geographicallydispersed
teams -- each team with... / PCEs include Arcadia Common Lisp Framework CLF Melmac br to provide a special purpose programming language for the definition of
2280.3 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
2277.3 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
2276.9 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
2273.8 Atlantique Research Overview - Paige(Correct)
f these transformations are combined to form functional
specification languages (making use of fixed point operations) that can be compiled into programs
with worst case asymptotic time and space boun... / with conventional manual programming in a low level algebraic br in the APTS transformational programming system Feasibility of
2265.0 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
2262.8 Graphite: A Suite of Hygraph Visualization Utilities - Unix Version.. - Noik (1993)(Correct)
This document provides a high level overview of the functionality realized by a set of C++ programs that comprise the
graphite utilities. The current package supports general and directed graphs and ... / GXF syntax is similar to that of the LISP programming language. A GXF file is br is similar to that of the LISP programming language. A GXF file is a
2260.7 Synthesis of Sigma-Pi Neural Networks by the Breeder Genetic.. - Zhang, Mühlenbein (1994)(Correct)
Genetic programming has been successfully applied
to evolve computer programs for solving a variety of
interesting problems. In the previous work we introduced
the breeder genetic programming (BGP) me... / are expressed as parse trees or LISP S-expressions. Fitness br Networks by the Breeder Genetic Programming Byoung-Tak Zhang and Heinz
2253.3 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
2248.7 Interprocedural Register Allocation for Lazy Functional Languages - Boquist (1995)(Correct)
The aim of this paper is two-fold; first, we develop an interprocedural
register allocation algorithm, an extended variant
of Briggs' optimistic graph colouring. We use interprocedural
coalescing as a... / is normally not a problem since his Lisp programs normally spend most of br register allocation for Lisp. Register allocation in general
2245.0 Semantics and Compilation of Recursive Sequential Streams in 8½ - Giavitto, De Vito, Michel(Correct)
Recursive definition of streams (infinite lists of values) have
been proposed as a fundamental programming structure in various fields.
A problem is to turn such expressive recursive definitions int... / been proposed as a fundamental programming structure in various fields. A br and needs. Since the declarative programming language Lucid more and
2242.9 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 -
2241.1 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
2236.3 Efficient and Language-Independent Mobile Programs - Adl-Tabatabai, Langdale, Lucco, Wahbe (1996)(Correct)
This paper evaluates the design and implementation of Omniware:
a safe, efficient, and language-independent system for
executing mobile program modules. Previous approaches to
implementing mobile code... / such as C CPascal Common Lisp and Fortran. In the software br Pldi' Acm Sigplan' Conf. On Programming Language Design And
2236.3 The Use of Dependency Relationships in the Control of Reasoning - Doyle (1976)(Correct)
Several recent problem-solving programs have indicated improved methods for controlling
program actions. Some of these methods operate by analyzing the time-independent
antecedent-consequent dependenc... / method is that of explicitly programming the logic of the solution br form this method assumes is the programming of the process as a decision
2233.7 Architectures and Monitoring Techniques for Active Databases: An.. - Chakravarthy (1992)(Correct)
The need for active capability for non-traditional applications and its concomitant benefits are well-established. Although the event-based technique for monitoring conditions (leading to the integrat... / machine using Symbolics Common Lisp and flavors. This prototype was br object-oriented DBMS using Common Lisp. Section discusses the design and
2228.5 Implementation of the Coordination Language C&Co - Forst (1995)(Correct)
This thesis describes the implementation of a compiler which translates the
language C&Co into C.
C&Co is the second representative of a coordination language that works
with the so called coordinati... / suited for a language like Prolog Lisp or-for the bold-APL Does the br as C Prolog Fortran and Lisp. The host language is responsible
2218.3 A Verified Vista Implementation - Curzon (1993)(Correct)
Specification of Compiler Correctness
1.3 Compiler Specifications
A compiler (the code generation part at least) must produce object code whose
meaning corresponds to that of the source program. An ... / readable form. For example the LISP-like concrete syntax of Piton is br logic resembling pure Lisp and hence is executable. The
2218.2 SOOP - A Synthesizer of an Object-Oriented Parser - Gil, Lorenz (1995)(Correct)
We present a tool for the use of software engineering tool builders. The tool parses programs and synthesizes them into a hierarchy of objectoriented classes and objects. This hierarchy lays the groun... / interpreted languages such as Lisp Prolog and to some extent br programming environment of Lisp and SmallTalk. The challenge
2218.2 Research notes on computational issues in defeasible reasoning - Vreeswijk(Correct)
Argument-based nonmonotonic reasoning relies on a principle, known as
defeat among arguments. The idea is that a logical statement holds if (and only
if) that statement is supported by an argument th... / in C Loui and others in Lisp Pollock Gordon Loui br in a satisfactory manner. For the programmers who in many cases were also
2202.5 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
2202.1 Therapy Plan Generation as Program Synthesis - Arnold, Jantke (1994)(Correct)
There has been developed and implemented an algorithm for
the automatic synthesis of therapy plans for complex dynamic systems.
This algorithm is the core of some control synthesis module which is
e... / algorithm is implemented in LISP and running under SUN OS on Sparc br to those synthesizing LISP expressions or Prolog programs
2199.9 Genetic Algorithms and Heuristic Search - Jones, Forrest (1995)(Correct)
Genetic algorithms (GAs) and heuristic search are shown to be
structurally similar. The strength of the correspondence and its practical
consequences are demonstrated by considering the relationship
b... / integers representing permutations lisp S-expressions and variable-length br whose vertices correspond to lisp Sexpressions or permutations of
2195.3 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
2194.1 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