3. ALP 1992: Volterra, Italy

Hélène Kirchner, Giorgio Levi (Eds.): Algebraic and Logic Programming, Third International Conference, Volterra, Italy, September 2-4, 1992, Proceedings. Lecture Notes in Computer Science 632 Springer 1992, ISBN 3-540-55873-X BibTeX

@proceedings{DBLP:conf/alp/1992,
  editor    = {H{\'e}l{\`e}ne Kirchner and
               Giorgio Levi},
  title     = {Algebraic and Logic Programming, Third International Conference,
               Volterra, Italy, September 2-4, 1992, Proceedings},
  booktitle = {ALP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {632},
  year      = {1992},
  isbn      = {3-540-55873-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Hassan Aït-Kaci: Outline of an Object-Oriented Calculus of Higher Type (Abstract). 1-2 BibTeX
Hartmut Ehrig, Francesco Parisi-Presicce: High-Level-Replacement Systems for Equational Algebraic Specifications. 3-20 BibTeX
Pierre Lescanne: Termination of Rewrite Systems by Elementary Interpretations. 21-36 BibTeX
Isabelle Gnaedig: Termination of Order-sorted Rewriting. 37-52 BibTeX
Bernhard Gramlich: Generalized Sufficient Conditions for Modular Termination of Rewriting. 53-68 BibTeX
Krzysztof R. Apt, Elena Marchiori, Catuscia Palamidessi: A Theory of First-Order Built-in's of Prolog. 69-83 BibTeX
Maurizio Gabbrielli, Maria Chiara Meo: Fixpoint Semantics for Partial Computed Answer Substitutions and Call Patterns. 84-99 BibTeX
Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael J. Maher: Oracle Semantics for Prolog. 100-114 BibTeX
Miki Hermann: On the Relation Between Primitive Recursion, Schematization and Divergence. 115-127 BibTeX
Berthold Hoffmann: Term Rewriting with Sharing and Memoïzation. 128-142 BibTeX
Sergio Antoy: Definitional Trees. 143-157 BibTeX
José Meseguer: Multiparadigm Logic Programming. 158-200 BibTeX
Hoon Hong: Non-linear Real Constraints in Constraint Logic Programming. 201-212 BibTeX
Francisco Javier López-Fraguas: A General Scheme for Constraint Functional Logic Programming. 213-227 BibTeX
Michael Hanus: Incremental Rewriting in Narrowing Derivations. 228-243 BibTeX
Aart Middeldorp, Erik Hamoen: Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract). 244-258 BibTeX
Rachid Echahed: Uniform Narrowing Strategies. 259-275 BibTeX
Olav Lysne: Proof by Consistency in Constructive Systems with Final Algebra Semantics. 276-290 BibTeX
Reinhard Bündgen, Hasko Eckhardt: A Fast Algorithm for Ground Normal Form Analysis. 291-305 BibTeX
Thérèse Hardin: Eta-conversion for the Languages of Explicit Substitutions. 306-321 BibTeX
Andy King, Paul Soper: Serialisation Analysis of Concurrent Logic Programs. 322-334 BibTeX
Alessandro Giovini, Franco Morando, Antonio Capani: Implementation of a Toolset for Prototyping Algebraic Specifications of Concurrent Systems. 335-349 BibTeX
Cosimo Laneve, Ugo Montanari: Axiomatizing Permutation Equivalence in the Lambda-Calculus. 350-363 BibTeX
Michael J. Maher: A CLP View of Logic Programming. 364-383 BibTeX
Chandrabose Aravindan, Phan Minh Dung: Partial Deduction of Logic Programs wrt Well-Founded Semantics. 384-402 BibTeX
Philippe Balbiani: The Finiteness of Logic Programming Derivations. 403-419 BibTeX
Leo Bachmair, Harald Ganzinger, Uwe Waldmann: Theorem Proving for Hierarchic First-Order Theories. 420-434 BibTeX
Rolf Socher-Ambrosius: A Goal Oriented Strategy Based on Completion. 435-445 BibTeX
Alexandre Boudet, Evelyne Contejean: On n-Syntactic Equational Theories. 446-457 BibTeX