2. ALP 1990: Nancy, France

Hélène Kirchner, Wolfgang Wechler (Eds.): Algebraic and Logic Programming, Second International Conference, Nancy, France, October 1-3, 1990, Proceedings. Lecture Notes in Computer Science 463 Springer 1990, ISBN 3-540-53162-9 BibTeX

@proceedings{DBLP:conf/alp/1990,
  editor    = {H{\'e}l{\`e}ne Kirchner and
               Wolfgang Wechler},
  title     = {Algebraic and Logic Programming, Second International Conference,
               Nancy, France, October 1-3, 1990, Proceedings},
  booktitle = {ALP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {463},
  year      = {1990},
  isbn      = {3-540-53162-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Talk

Joseph A. Goguen: Proving and Rewriting. 1-24 BibTeX

Session 1

Jordi Farrés-Casals: Proving Correctness wrt Specifications with Hidden Parts. 25-39 BibTeX
H. R. Walters: Hybrid Implementations of Algebraic Specifications. 40-54 BibTeX

Session 2

Françoise Debart, Patrice Enjalbert, Madeleine Lescot: Multi-Modal Logic Programming using Equational and Order-Sorted Logic. 55-69 BibTeX
Michael Hanus: Logic Programs with Equational Type Specifications (Extended Abstract). 70-85 BibTeX
Zhenyu Qian: Higher-Order Order-Sorted Algebras. 86-100 BibTeX
François Bronsard, Uday S. Reddy: Axiomatization of a Functional Logic Language. 101-116 BibTeX

Invited Talk

Tien Huynh, Catherine Lassez, Jean-Louis Lassez: Fourier Algorithm Revisited. 117-131 BibTeX

Session 3

Aïda Batarekh: Fixpoint Techniques for Non-Monotone Maps. 132-143 BibTeX
Yuli Zhou, Robert Muller: Domain Theory for Nonmonotonic Functions. 144-157 BibTeX
Phan Minh Dung: On the strong completion of logic programs. 158-172 BibTeX
Taisuke Sato: An Equivalence Preserving First Order Unfold/fold Transformation System. 173-188 BibTeX

Session 4

Helmut Simonis, Mehmet Dincbas: Propositional Calculus Problems in CHIP. 189-203 BibTeX
Maurizio Gabbrielli, Giorgio Levi: Unfolding and Fixpoint Semantics of Concurrent Constraint Logic Programs. 204-216 BibTeX
Kanchana Kanchanasut, Peter J. Stuckey: Eliminating Negation from Normal Logic Programs. 217-231 BibTeX

Session 5

Patrick Saint-Dizier: On Logic Programming Interpretations of Dislog: Programming Long-Distance Dependencies in Logic. 232-246 BibTeX
Jia Liang Han: Recursive Query Processing in Predicate-Goal Graph. 247-261 BibTeX

Invited Talk

Pierre Lescanne: Implementations of Completion by Transition Rules + Control: ORME. 262-269 BibTeX

Session 6

Françoise Bellegarde: A Matching Process Modulo a Theory of Categorical Products. 270-282 BibTeX
Nachum Dershowitz, Subrata Mitra, G. Sivakumar: Equation Solving in Conditional AC-Theories. 283-297 BibTeX
Juan José Moreno-Navarro, Herbert Kuchen, Rita Loogen, Mario Rodríguez-Artalejo: Lazy Narrowing in a Graph Machine. 298-317 BibTeX , ->BABEL
Nachum Dershowitz, Naomi Lindenstrauss: An Abstract Concurrent Machine for Rewriting. 318-331 BibTeX

Session 7

Reinhard Bündgen: Applying Term Rewriting Methods to Finite Groups. 332-346 BibTeX
Dieter Hofbauer: Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths. 347-358 BibTeX
Ke Li: Optimization of Rewriting and Complexity of Rewriting. 359-371 BibTeX
Joachim Steinbach: AC-Termination of Rewrite Systems: A Modified Knuth-Bendix Ordering. 372-386 BibTeX