Algebraic and Logic Programming: 4th International Conference, ALP '94 Madrid, Spain, September 14–16, 1994 Proceedings

313 Pages·1994·6.97 MB·English

by  Catuscia Palamidessi (auth.)

Lecture Notes in Computer Science 850
Edited by G. Goos, J. Hartmanis and J. van Leeuwen
Advisory Board: .W Brauer D. Gries J. Stoer
Giorgio Levi
Mario Rodrfguez-Artalejo ).sdE(
ciarbeglA dna Logic
gnimmargorP
4th International Conference, ALP '94
Madrid, Spain, September 14-16, 1994
Proceedings
galreV-regnirpS
Berlin Heidelberg kroYweN
London Paris oykoT
gnoH gnoK Barcelona
Budapest
Series Editors
Gerhard Goos
Universit~it Karlsruhe
Postfach 69 80, Vincenz-Priessnitz-Strage ,1 D-76131 Karlsruhe, Germany
Juris Hartmanis
Department of Computer Science, Cornell University
4130 Upson Hall, Ithaka, NY 14853, USA
Jan van Leeuwen
Department of Computer Science, Utrecht University
Padualaan ,41 3584 CH Utrecht, The Netherlands
Volume Editors
Giorgio Levi
Department of Computer Science, University of Pisa
Corso Italia 40, 1-56125 Pisa, Italy
Mario Rodrfguez-Artalejo
Departamento de Inform~itica y Autom~tica
Facultad de Matemfiticas, Universidad Complutense
.vA Compultense s/n, E-28040 Madrid, Spain
CR Subject Classification (1991): D.3, F.3-4, 1.2.3
ISBN 3-540-58431-5 Springer-Verlag Berlin Heidelberg New York
CIP data applied for
This work is subject to copyright. All rights are reserved, whether the whole or part
of the material is concerned, specifically the rights of translation, reprinting, re-use
of illustrations, recitation, broadcasting, reproduction on microfilms or in any other
way, and storage in data banks. Duplication of this publication or parts thereof is
permitted only under the provisions of the German Copyright Law of September 9,
1965, in its current version, and permission for use must always be obtained from
Springer-Veflag. Violations are liable for prosecution under the German Copyright
Law.
(cid:14)9 Springer-Veflag Berlin Heidelberg 1994
Printed in Germany
Typesetting: Camera-ready by author
SPIN: 10475508 4513140-543210 - Printed on acid-free paper
Foreword
This volume contains the Proceedings of the Fourth International Conference on
Algebraic and Logic Programming (ALP), held in Madrid (Spain) on September -41
,61 1994.
Following the intention of the three previous ALP meetings in Gaussig (1988),
Nancy (1990) and Volterra (1992), the conference aims at strengthening the con-
nections between algebraic techniques and logic programming. Logic programming
has been very successful during the last decades. Many efforts have been made to
enhance its expressive power and efficiency, including in particular the emergence of
constraint logic programming. On the other hand, the algebraic approach is very
well suited to deal with such key notions as functions, types, equational theories, and
modularity. As on previous occasions, ALP offers a unique opportunity to promote
the application of algebraic tools within logic programming and the cross-fertilizing
exchange of ideas among researchers from the algebraic and logic communities.
On this occasion, ALP is held concurrently with the Sixth International Sym-
posium on Programming Language Implementation and Logic Programming
(PLILP), which aims at stimulating research on new declarative concepts, methods,
and techniques relevant for the implementation of programming languages, with
particular emphasis on declarative ones.
The ALP Program Committee met in Madrid on May 6, 1994, and selected 71
papers from 41 submissions, coming from 71 countries. The selected contributions
mainly cover the following topics:
algebraic specification, theorem proving
term rewriting, narrowing, resolution
program semantics, analysis, transformations
equational logic programming
concurrent logic programming
higher-order features
In addition to the selected papers, the scientific program includes three invited
lectures (shared with PLILP) by Dale Miller (Univ. of Pennsylvania, USA), Catuscia
Palamidessi (Univ. of Genova, Italy), and Robert Paige (Univ. of New York, USA).
Abstracts of the invited talks are included both in this volume and in the proceedings
volume of PLILP '94. A full version of Paige's invited paper can be found in the
proceedings of PLILP '94
We would like to thank all members of the Program Committee and all the
referees for their careful work in the reviewing and selection process.
Last but not least, we express our gratitude to all members of the local organizing
committees, both of ALP and PLILP, for the effort they have invested.
July 1994 Giorgio Levi, Mario Rodrfguez-Artalejo
Co-chairmen
Iv
Program Committee
Krzysztof Apt (Amsterdam) Fernando Orejas (Barcelona)
Egidio Astesiano )avoneG( ecneruaL Puel (Orsay)
Harald Ganzinger )nekcifrbraaS( Mario Rodrlguez-Artalejo (Madrid),
Claude Kirchner (Nancy) riahc-oC
Giorgio Levi (Pisa), Co-chair Jerzy Tiuryn )wasraW(
Michael Maher (Yorktown Heights) Andrei voknoroV (Uppsala)
Local Organization
Lourdes Araujo Serna, Francisco Bueno Carrillo, Daniel Cabeza Gras, Manuel
Carro Lifiares, Julio Garcia Martin, le.gn.A Herranz Nieva, Maria Teresa Hortals
sznoG Javier Leach Albert (orgamzmg co-chair), Francisco L6pez Fraguas,
Julio Marifio Carballo, Juan @soJ oneroM Navarro (organizing co-chair), Germs
Puebla sS
List of Referees
I.Alouini, M.Alpuente, A.Amadio, S.Anantharaman, R.Bagnara, R.Barbuti,
J.Barklund, H.Baumeister, A.Bockmayr, A.Bossi, M.Bugliesi, M.Cerioli,
J.Chabin, A.Cichon, E.Contejean, R.Cousot, F.S.de Boer, Ph.de Groote,
P.Dell'Acqua, R.di Cosmo, K.Doets, E.Domenjoud, A.Dovier, W.Drabent,
E.Engel, M.Falaschi, M.Fernandez, G.File, M.Fitting, M.Gabbrielli, D.Galmiche,
A.Gavilanes, I.Gnaedig-Antoine, A.Gil, P.Graf, M.Hanus,
N.Heintze, C.Hintermeier, M.T.Hortal&, J.Hsiang, P.Inverardi, D.Kesner,
Z.Khasidashvili, H.Kirchner, T.Lindgren, G.Longo, D.Lugiez, P.Mancarella,
V.Manca, ,@hcraM.C M.Martelli, A.Masini, S.Michaylov, A.Middeldorp,
H.Millroth, E.Moggi, U.Montanari, F.Morando, U.Neumerkel, R.Nieuwenhuis,
S.Nieva, D.Niwifiski, S.O.NystrSm, M.Ortega , C.Palamidessi, E.Palmgren,
M.Parigot, D.Pedreschi, K.Rao, G.Reggio, C.Ringeissen, J.J.Ruz, P.R~ty
H.Seki, V.Stoltenberg-Hansen, J.Stuber, A.Szatas, F.S~enz, A.Tarlecki, E.Tick,
,n&roT.J Y.Toyama, P.Urzyczyn, P.van Erode Boas, F.van Raamsdonk, G.Vidal,
M.Vittek, U.Waldmann, E.Waller, H.Zantema.
Supporters (of ALP & PLILP)
The Association of Logic Programming
Universidad Complutense ed Madrid )MCU(
Universidad Polit~cnica ed Madrid (UPM)
CICYT
European Comission- Esprit Basic hcraeseR
Esprit COMPULOG-NET
Esprit BR GW CCL (EP )8206
Comunidad Aut6noma ed Madrid
ATI
NUS Microsystems- Spain
Contents
Invited Talks
Concurrent Constraint Programming )tcartsbA(
.C Palamidessi (Univ. di Genova, Italy)
Specifications Using Multiple-Conclusion Logic Programs (Abstract)
D. Miller (Univ. of Pennsylvania, USA)
Viewing a Program Transformation System at Work (Abstract)
R. Paige (Univ. of New York, USA)
Theorem Proving
Proving Implications by Algebraic noitamixorppA 6
M. Codish and .G Mashevitzky (Ben-Gurion Univ. of the Negev, Israel)
Sufficient Completeness and Parameterized Proofs by Induction 32
A. Bouhoula (CRIN-INRIA-Lorraine, Nancy, France)
Proving Behavioural Theorems with Standard First-Order Logic 14
M. Bidoit (LIENS-CNRS URA & Ecole Normale Supdrieure, Paris, France)
R. Hennicker (Ludwig-Maximilians-Univ. Miinchen, Germany)
Narrowing r
How to Realize ESL gniworraN 95
A. Werner (Univ. Karlsruhe, Germany)
A. Bockmayr (MPI, Saarbriicken, Germany)
S. Krischer (CRIN-INRIA-Lorraine, Nancy, France)
Compositional Analysis for Equational Horn Programs 77
M. Alpuente (Univ. Politdcnica de Valencia, Spain)
M. Falaschi (Univ. di Padova, Italy)
.G Vidal (Univ. P acincMilo de Valencia, Spain)
Equation Solving in Projective Planes and Planar Ternary Rings 59
P. Balbiani (lnsitute de Recherche en lnformatique, Toulouse, France)
iiiv
Logic Programming I
From Eventual to Atomic and Locally Atomic CC Programs:
A Concurrent Semantics 411
F. Bueno, M. olcligenemreH (Univ. Politdcnica de Madrid, Spain)
.U Montanari, F. Rossi (Univ. di Pisa, Italy)
Concurrent Logic Programming sa Uniform Linear Proofs 331
P. Votpe (Univ. di lisa, Italy)
Three-Valued Completion for Abductive Logic Programs 051
F. Teusink (CWI, Amsterdam, The Netherlands)
Term Rewriting
A Sequential Reduction Strategy 861
S. Antoy (Portland State Univ., USA)
A. Middeldorp (Univ. of Tsukuba, Japan)
nO Modularity of Termination and Confluence Properties
of Conditional Rewrite Systems 681
B. Gramlich (Univ. Kaiserslautern, Germany)
Syntactical Analysis of Total Termination 402
M.C.F. Ferreira and H. Zantema (Utrecht Univ., The Netherlands)
Logic Programs sa Term Rewriting Systems 322
M. Marchiori (Univ. di Padova, Italy)
Higher-Order Programming
redrO-rehgiH Minimal Function shparG 242
N.D. Jones, M. Rosendahl (Univ. of Copenhagen, Denmark)
Reasoning About Layered, Wildcard and Product Patterns 352
D. Kesner (CNRS-LRI, Univ. de Paris-Sud, France)
Logic Programming II
Prserving Universal Termination Through Unfold/Fold 962
A. Bossi (Univ. di Padova, Italy)
N, Cocco (Univ. di Venezia-Ca'Foscari, Italy)
A Logic for Variable Aliasing in Logic Programs 782
E. Marchiori (CWI, Amsterdam, The Netherlands)
Concurrent Constraint Programming
(Abstract of Lecture)
Catuscia Palamidessi
Dipartimento di Informatica e Scienze dell'Informazione (DISI)
Universit~ di Genova
via Benedetto XV ,3 16132, Genova, Italy
[email protected]
In the last years there have been several proposals to extend logic programming
with the constructs for concurrency, aiming at the development of a concurrent
language which would maintain the typical advantages of logic programming:
declarative reading, computatibns as proofs, amenability to meta-programnnng
etc. Examples of concurrent logic languages include PARLOG 6J, Concurrent
Protog 12, Guarded Horn Clauses 15 and their so-called fiat versions.
Concurrent constraint programming (cop) 11, 13, 41 represents one of the
most successful proposals in this area. Basically, ccp presents two new perspec-
tives on the underlying philosophy of logic programming. One is the replacement
of the concept of unification over the Herbrand universe by the more general no-
tion of constraint over an arbitrary domain. This is in a sense a 'natural' develop-
ment, and the idea was already introduced in ~sequential' logic programming by
Jaffar and Lassez 8. The other is the introduction of explicit operators typical
of the traditional concurrent paradigms, like CCS, TCSP and ACP 10, 5, ;1
in particular, the choice (+), the action prefizing (--o), and the hiding operator
(3). Communication and synchronization are achieved by means of two kinds
of actions: ask (originally introduced by Maher in 9), which checks wether a
store entails a certain constraint, and tell, which adds a constraint to the store.
Also in concurrent logic languages these control features were present, but in
an"implicit" way: the choice was represented by alternative clauses, hiding by
local (existentially quantified) variables, prefixing by commitment, communica-
tion by sharing of variables, and synchronization by restrictions on the unification
algorithm.
With respect to the other concurrent logic languages, ccp has a clean alge-
braic structure, and it is based on a 'minimal' set of concepts. With respect
to other concurrent paradigms, ccp is characterized by the logical interpreta-
tion of computations 3, and by the monotonic evolution of the store. This last
feature allows an agent to be representable as a Scott's closure operator and
denoted by the set of its fixpoints. For the so-called confluent ccp 7, where
process scheduling doesn't affect the results, closure operators corresponding to
agents can be defined in a structural way, thus leading to a very simple deno-
tational semantics. In the full cop, on the contrary, the parallel composition of
processes requires structures encoding the various behaviors relative to different
interleaving possibilities, like reactive sequences 4 or bounded trace operators
14.
Concerning expressiveness, monotonicity imposes a heavy limitation, at least
in the basic paradigm where the tell is eventual. The alternative proposal, based
on atomic tell, on the other hand, is not very suitable for distributed implemen-
tation. We argue that a good compromise could be obtained by enriching the
language with an action removing information from the store 2.
References
.1 J.A. Bergstra and J.W. Klop. Process algebra: specification and verification in
bisimulation semantics. In Mathematics and Computer Science II, CWI Mono-
graphs, pages 16 - .49 North-Holland, 1986.
.2 F.S. de Boer, E. Best, and C. Palamidessi. Concurrent Constraint Programming
with Information Removal. Technical Report, Dipartlmento di Informatica, Uni-
versit~ di Genova, Genova. 1994.
.3 F.S. de Boer, .M Gabbrielli, E. Marchiori, and C. Palamidessi. Proving Concur-
rent Constraint Programs Correct. In Proe. Eighteenth Annual A CM Syrup. on
Principles of Programming Languages, 1993.
.4 F.S. de Boer and C. Palamidessi. A fully abstract model for concurrent con-
straint programming. In .S Abramsky and T.S.E. Maibaum, editors, Proc. of TAP-
SOFT/CAAP, volume 394 of Lecture 1Votes in Computer Science, pages 296-319.
Springer-Verlag, 1991.
.5 S.D. Brookes, C.A.R. Hoare, and W. Roscoe. A theory of communicating sequen-
tial processes. Journal of ACM, 31:499-560, 1984.
.6 K.L. Clark and .S Gregory. PARLOG: parallel programming in logic. ACM Trans.
on Programming Languages and Systems, (8):1-49, 1986.
.7 M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi. Confluence and Con-
current Constraint Programming. Technical Report, Dipartimento di Informatica,
Universit~ di Pisa, Pisa. 1994.
.8 J. Jaffar and J.-L. Lassez. Constraint logic programming. In Proc,. of ACM Sym-
posium on Principles of Programming Languages, pages 111-119. ACM, New York,
.7891
.9 M. J. Maher. Logic semantics for a class of committed-choice programs. In Jean-
Louis Lassez, editor, Proc. of the Fourth International Conference on Logic Pro-
gramming, Series in Logic Programming, pages 858-876, Melbourne, 1987. The
MIT Press.
.01 R. Milner. A Calculus of Communicating Systems2 volume 29 of Lecture Notes in
Computer Science. Springer-Verlag, New York, 1980.
.11 V.A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis,
Carnegie-Mellon University, January 1989. Pubhshed by The MIT Press, U.S.A.,
.0991
.21 E.Y. Shapiro. A subset of Concurrent Prolog and its interpreter. Technical Report
TR-003, Institute for New Generation Computer Technology (ICOT), Tokyo, 1983.
.31 V.A. Saraswat and .M Pdnard. Concurrent constraint programming. In Proc. of
the seventeenth A CM Symposium on Principles of Programming Languages, pages
232-245. ACM, New York, 1990.
.41 V.A. Saraswat, M. Rinard, and P. Panangaden. Semantics foundations of Con-
current Constraint Programming. In Proc. of the eighteenth A CM Symposium on
Principles of Programming Languages. ACM, New York, 1991.
.51 K. Ueda. Guarded Horn Clauses. In E. Y. Shapiro, editor, Concurrent Prolog:
Collected Papers. The MIT Press, 1987.
Specifications using multiple-conclusion
logic programs *
(Abstract fo Lecture)
Dale Miller
Computer Science Department
University of Pennsylvania
Philadelphia, PA 19104-6389 USA
dale@saul, cis .uperm. edu
Multiset rewriting has proved to be a useful presentation of process synchroniza-
tion ,1 2, 3, .6 Since sequent calculus presentations of logics that do not use
the structural rules of contractions and weakening are based on using multisets
of formulas as left and right contexts, it is natural to identify processes with for-
mulas, multisets with sequent contexts, and multiset rewriting as an inference
rule. Given earlier work on using sequent calculus to describe logic program-
ming as goal-directed search for proofs 8, it is most natural to use right-hand
contexts of sequents to represent multisets of processes. This choice requires the
identification of the multiset constructor and the empty multiset with the multi-
plicative disjunction and false (the ~ and k_ of linear logic 4), and backchaining
with a single step of multiset rewriting. While the logic programming language
)~Prolog 10 and its linear logic refinement Lolli 5 contain rich sources of ab-
straction (such as modular programming, abstract data types, and higher-order
programming), they contain no primitives for specifying concurrency, communi-
cations, or synchronization. If multiset rewriting is added to Lolli via the logical
connectives ~ and .k, the result is a language that contains primitives for both
abstraction and concurrency. Surprisingly, the resulting logic, called Forum 7,
is a presentation of all of linear logic in the sense that all of the connectives of
linear logic can be defined via logical equivalences using only the connectives of
Forum. Thus the rich meta-theory of linear logic, for example, the de Morgan
dualities and cut-elimination, can be applied to the analysis of Forum programs.
Several examples to illustrate the expressiveness of this presentation of linear
logic will be given. These examples will involve a specification of sequent calculi
for object-level logics, a specification of the ~r-calculus 9, and a specification of
a functional programming language that contains side-effects and concurrency
operators. In each of these examples, we shall argue that the specification is
perspicuous and modular and that the meta-theory of linear logic can be used
to derive properties of the specification.
* The work presented here is supported in part by grants ONR ,4231-1-39-41000N
NSF CCR-91-02753, NSF CCR-92-09224, and DARPA .8100-K-58-41000N