default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. ALP 1992: Volterra, Italy
- Hélène Kirchner, Giorgio Levi:
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 - Hassan Aït-Kaci:
Outline of an Object-Oriented Calculus of Higher Type (Abstract). 1-2 - Hartmut Ehrig, Francesco Parisi-Presicce:
High-Level-Replacement Systems for Equational Algebraic Specifications. 3-20 - Pierre Lescanne:
Termination of Rewrite Systems by Elementary Interpretations. 21-36 - Isabelle Gnaedig:
Termination of Order-sorted Rewriting. 37-52 - Bernhard Gramlich:
Generalized Sufficient Conditions for Modular Termination of Rewriting. 53-68 - Krzysztof R. Apt, Elena Marchiori, Catuscia Palamidessi
:
A Theory of First-Order Built-in's of Prolog. 69-83 - Maurizio Gabbrielli, Maria Chiara Meo:
Fixpoint Semantics for Partial Computed Answer Substitutions and Call Patterns. 84-99 - Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael J. Maher:
Oracle Semantics for Prolog. 100-114 - Miki Hermann:
On the Relation Between Primitive Recursion, Schematization and Divergence. 115-127 - Berthold Hoffmann:
Term Rewriting with Sharing and Memoïzation. 128-142 - Sergio Antoy:
Definitional Trees. 143-157 - José Meseguer:
Multiparadigm Logic Programming. 158-200 - Hoon Hong:
Non-linear Real Constraints in Constraint Logic Programming. 201-212 - Francisco Javier López-Fraguas:
A General Scheme for Constraint Functional Logic Programming. 213-227 - Michael Hanus:
Incremental Rewriting in Narrowing Derivations. 228-243 - Aart Middeldorp, Erik Hamoen:
Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract). 244-258 - Rachid Echahed:
Uniform Narrowing Strategies. 259-275 - Olav Lysne:
Proof by Consistency in Constructive Systems with Final Algebra Semantics. 276-290 - Reinhard Bündgen, Hasko Eckhardt:
A Fast Algorithm for Ground Normal Form Analysis. 291-305 - Thérèse Hardin:
Eta-conversion for the Languages of Explicit Substitutions. 306-321 - Andy King, Paul Soper:
Serialisation Analysis of Concurrent Logic Programs. 322-334 - Alessandro Giovini, Franco Morando, Antonio Capani:
Implementation of a Toolset for Prototyping Algebraic Specifications of Concurrent Systems. 335-349 - Cosimo Laneve, Ugo Montanari:
Axiomatizing Permutation Equivalence in the Lambda-Calculus. 350-363 - Michael J. Maher:
A CLP View of Logic Programming. 364-383 - Chandrabose Aravindan, Phan Minh Dung:
Partial Deduction of Logic Programs wrt Well-Founded Semantics. 384-402 - Philippe Balbiani:
The Finiteness of Logic Programming Derivations. 403-419 - Leo Bachmair, Harald Ganzinger, Uwe Waldmann:
Theorem Proving for Hierarchic First-Order Theories. 420-434 - Rolf Socher-Ambrosius:
A Goal Oriented Strategy Based on Completion. 435-445 - Alexandre Boudet, Evelyne Contejean:
On n-Syntactic Equational Theories. 446-457
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-05-17 00:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
