Algebraic and Logic Programming
1997
- Parameterised Higher-Order Algebraic Specificationsby: L. J. Steggles
- Optimal Non-deterministic Functional Logic Computationsby: Sergio Antoy
- On Composable Properties of Term Rewriting Systemsby: Takahito Aoto, Yoshihito Toyama
- Parallelizing Functional Programs by Generalizationby: Alfons Geser, Sergei Gorlatch
- Higher-Order Equational Unification via Explicit Substitutionsby: Claude Kirchner, Christophe Ringeissen
- Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-Order Functional Logic Languageby: Taro Suzuki, Koji Nakagawa, Tetsuo Ida
- Model Generation with Existentially Quantified Variables and Constraintsby: Slim Abdennadher, Heribert Schütz
- Perpetuality and Uniform Normalizationby: Zurab Khasidashvili, Mizuhito Ogawa
- A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm Constraintsby: Michael Codish, Cohavit Taboch
- Safe Folding/Unfolding with Conditional Narrowingby: María Alpuente, Moreno Falaschi, Ginés Moreno, Germán Vidal
- Lazy Narrowing with Parametric Order Sorted Typesby: Jesús Manuel Almendros-Jiménez, Ana Gil-Luezas
- Explicit Substitutions for the Lambda-Calculusby: Gilles Barthe, Fairouz Kamareddine, Alejandro Ríos
- Termination of Algebraic Type Systems: The Syntactic Approachby: Gilles Barthe, Femke van Raamsdonk
- Needed Reductions with Context-Sensitive Rewritingby: Salvador Lucas
- A Left-Linear Variant of Lambda-Sigmaby: A. César, H. Muñoz
- Optimal Left-to-Right Pattern-Matching Automataby: Nadia Nedjah, Colin D. Walter, Stephen E. Eldridge
- Conditional Term Graph Rewritingby: Enno Ohlebusch
- Proof Net Semantics of Proof Search Computationby: Luís Caires, Luís Monteiro
- A Language for the Logical Specification of Processes and Relationsby: Luís Caires
- Abstractions of Uniform Proofsby: Paolo Volpe
- Meaningless Terms in Rewritingby: Richard Kennaway, Vincent van Oostrom, Fer-Jan de Vries
- The Semantic Treatment of Polymorphic Specification Languagesby: Dieter Nazareth
- Order-Sorted Termination: The Unsorted Wayby: Peter Csaba Ölveczky, Olav Lysne
- Algebraic Semantics for Functional Logic Programming with Polymorphic Order-Sorted Typesby: Jesús Manuel Almendros-Jiménez, Antonio Gavilanes-Franco, Ana Gil-Luezas
- Complementing Logic Program Semanticsby: Roberto Giacobazzi, Francesco Ranzato
- A Strict Border for the Decidability of E-Unification for Recursive Functionsby: Heinz Faßbender, Sebastian Maneth
- Discrete Normalization and Standardization in Deterministic Residual Structuresby: Zurab Khasidashvili, John R. W. Glauert
- A Process Algebra for Synchronous Concurrent Constraint Programmingby: Lubos Brim, Jean-Marie Jacquet, David Gilbert, Mojmír Kretínský
- Heterogeneous Constraint Solvingby: Frédéric Benhamou
- Prime Factorizations of Abstract Domains Using First Order Logicby: Elena Marchiori
- Lambda-Calculi with Explicit Substitutions and Composition Which Preserve Beta-Strong Normalizationby: Maria C. F. Ferreira, Delia Kesner, Laurence Puel
- On Negation As Instantiationby: Alessandra Di Pierro, Wlodzimierz Drabent
- An Algebraic Approach to Mixins and Modularityby: Davide Ancona, Elena Zucca
- Unique Normal Form Property of Higher-Order Rewriting Systemsby: Ken Mano, Mizuhito Ogawa
- Unravelings and Ultra-propertiesby: Massimo Marchiori
- Specifying Type Systemsby: Dieter Nazareth
- A Hierarchy of Semantics for Normal Constraint Logic Programsby: François Fages, Roberta Gori
- Independence in Dynamically Scheduled Logic Languagesby: Maria J. García de la Banda, Manuel V. Hermenegildo, Kim Marriott
- Standardization Theorem Revisitedby: Taro Suzuki
- Toward the Concurrent Implementation of Computational Systemsby: Ilies Alouini, Claude Kirchner
- Viewing A program Transformation System At Workby: Robert Paige
- Compositional Analysis for Equational Horn Programsby: María Alpuente, Moreno Falaschi, Germán Vidal
- Syntactical Analysis of Total Terminationby: Maria C. F. Ferreira, Hans Zantema
- Concurrent Logic Programming as Uniform Linear Proofsby: Paolo Volpe
- Specifications Using Multiple-Conclusion Logic Programsby: Dale Miller
- How to Realize LSE Narrowingby: Andreas Werner, Alexander Bockmayr, Stefan Krischer
- Equation Solving in Projective Planes and Planar Ternary Ringsby: Philippe Balbiani
- Higher-Order Minimal Functional Graphsby: Neil D. Jones, Mads Rosendahl
- Proving Behavioural Theorems with Standard First-Order Logicby: Michel Bidoit, Rolf Hennicker
- Concurrent Constraint Programmingby: Catuscia Palamidessi
- From Eventual to Atomic Locally Atomic CC Programs: A Concurrent Semanticsby: Francisco Bueno, Manuel V. Hermenegildo, Ugo Montanari, Francesca Rossi
- On Modularity of Termination and Confluence Properties of Conditional Rewrite Systemsby: Bernhard Gramlich
- Proving Implications by Algebraic Approximationby: Michael Codish, Grigory Mashevitzky
- Reasoning about Layered, Wildcard and Product Patternsby: Delia Kesner
- A Logic for Variable Aliasing in Logic Programsby: Elena Marchiori
- Preserving Universal Termination through Unfold/Foldby: Annalisa Bossi, Nicoletta Cocco
- Logic Programs as term Rewriting Systemsby: Massimo Marchiori
- Sufficient Completeness and Parameterized Proofs by Inductionby: Adel Bouhoula
- Three-Valued Completion for Abductive Logic Programsby: Frank Teusink
- A Sequential Reduction Strategyby: Sergio Antoy, Aart Middeldorp
- Multiparadigm Logic Programmingby: José Meseguer
- Definitional Treesby: Sergio Antoy
- Oracle Semantics for Prologby: Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael J. Maher
- Implementation of a Toolset for Prototyping Algebraic Specifications of Concurrent Systemsby: Alessandro Giovini, Franco Morando, Antonio Capani
- Non-linear Real Constraints in Constraint Logic Programmingby: Hoon Hong
- Theorem Proving for Hierarchic First-Order Theoriesby: Leo Bachmair, Harald Ganzinger, Uwe Waldmann
- A Theory of First-Order Built-in's of Prologby: Krzysztof R. Apt, Elena Marchiori, Catuscia Palamidessi
- Eta-conversion for the Languages of Explicit Substitutionsby: Thérèse Hardin
- A Fast Algorithm for Ground Normal Form Analysisby: Reinhard Bündgen, Hasko Eckhardt
- Fixpoint Semantics for Partial Computed Answer Substitutions and Call Patternsby: Maurizio Gabbrielli, Maria Chiara Meo
- On n-Syntactic Equational Theoriesby: Alexandre Boudet, Evelyne Contejean
- The Finiteness of Logic Programming Derivationsby: Philippe Balbiani
- Partial Deduction of Logic Programs wrt Well-Founded Semanticsby: Chandrabose Aravindan, Phan Minh Dung
- Outline of an Object-Oriented Calculus of Higher Type (Abstract)by: Hassan Aït-Kaci
- On the Relation Between Primitive Recursion, Schematization and Divergenceby: Miki Hermann
- Generalized Sufficient Conditions for Modular Termination of Rewritingby: Bernhard Gramlich
- High-Level-Replacement Systems for Equational Algebraic Specificationsby: Hartmut Ehrig, Francesco Parisi-Presicce
- Termination of Rewrite Systems by Elementary Interpretationsby: Pierre Lescanne
- Serialisation Analysis of Concurrent Logic Programsby: Andy King, Paul Soper
- A General Scheme for Constraint Functional Logic Programmingby: Francisco Javier López-Fraguas
- Axiomatizing Permutation Equivalence in the Lambda-Calculusby: Cosimo Laneve, Ugo Montanari
- Termination of Order-sorted Rewritingby: Isabelle Gnaedig
- A CLP View of Logic Programmingby: Michael J. Maher
- A Goal Oriented Strategy Based on Completionby: Rolf Socher-Ambrosius
- Term Rewriting with Sharing and Memoïzationby: Berthold Hoffmann
- Proof by Consistency in Constructive Systems with Final Algebra Semanticsby: Olav Lysne
- Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract)by: Aart Middeldorp, Erik Hamoen
- Uniform Narrowing Strategiesby: Rachid Echahed
- Incremental Rewriting in Narrowing Derivationsby: Michael Hanus
- Optimization of Rewriting and Complexity of Rewritingby: Ke Li
- On the strong completion of logic programsby: Phan Minh Dung
- Fourier Algorithm Revisitedby: Tien Huynh, Catherine Lassez, Jean-Louis Lassez
- Recursive Query Processing in Predicate-Goal Graphby: Jia Liang Han
- Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengthsby: Dieter Hofbauer
- Multi-Modal Logic Programming using Equational and Order-Sorted Logicby: Françoise Debart, Patrice Enjalbert, Madeleine Lescot
- Axiomatization of a Functional Logic Languageby: François Bronsard, Uday S. Reddy
- Fixpoint Techniques for Non-Monotone Mapsby: Aïda Batarekh
- On Logic Programming Interpretations of Dislog: Programming Long-Distance Dependencies in Logicby: Patrick Saint-Dizier
- Higher-Order Order-Sorted Algebrasby: Zhenyu Qian
- An Equivalence Preserving First Order Unfold/fold Transformation Systemby: Taisuke Sato
- Unfolding and Fixpoint Semantics of Concurrent Constraint Logic Programsby: Maurizio Gabbrielli, Giorgio Levi
- An Abstract Concurrent Machine for Rewritingby: Nachum Dershowitz, Naomi Lindenstrauss
- Implementations of Completion by Transition Rules + Control: ORMEby: Pierre Lescanne
- Proving Correctness wrt Specifications with Hidden Partsby: Jordi Farrés-Casals
- Proving and Rewritingby: Joseph A. Goguen
- A Matching Process Modulo a Theory of Categorical Productsby: Françoise Bellegarde
- Domain Theory for Nonmonotonic Functionsby: Yuli Zhou, Robert Muller
- AC-Termination of Rewrite Systems: A Modified Knuth-Bendix Orderingby: Joachim Steinbach
- Propositional Calculus Problems in CHIPby: Helmut Simonis, Mehmet Dincbas
- Equation Solving in Conditional AC-Theoriesby: Nachum Dershowitz, Subrata Mitra, G. Sivakumar
- Eliminating Negation from Normal Logic Programsby: Kanchana Kanchanasut, Peter J. Stuckey
- Hybrid Implementations of Algebraic Specificationsby: H. R. Walters
- Lazy Narrowing in a Graph Machineby: Juan José Moreno-Navarro, Herbert Kuchen, Rita Loogen, Mario Rodríguez-Artalejo
- Logic Programs with Equational Type Specifications (Extended Abstract)by: Michael Hanus
- Applying Term Rewriting Methods to Finite Groupsby: Reinhard Bündgen
- Boolean Valued Models and Incomplete Specificationsby: Bernd I. Dahn
- Refined Compilation of Pattern-Matching for Functional Languagesby: Ph. Schnoebelen
- Nondeterministic Algebraic Specifications and Nonconfluent Term Rewritingby: Heinrich Hußmann
- OBJ: Programming with Equalities, Subsorts, Overloading and Parameterizationby: Jean-Pierre Jouannaud, Claude Kirchner, Hélène Kirchner, Aristide Mégrelis
- Proving Inductive Theorems Based on Term Rewriting Systemsby: Dieter Hofbauer, Ralf-Detlef Kutsche
- Solving Equations in an Equational Languageby: Jia-Huai You
- Fuzzy Reasoning Based on F-Horn Clause Rulesby: Dongbo Liu, Deyi Li
- ACP with Signalsby: Jan A. Bergstra
- A Completion Procedure for Hierarchical Conditional Rewriting Systemsby: Wadoud Bousdira
- Narrowing in Partial Conditional Equational Theories (Abstract)by: Uwe Wolter
- BABEL: A Functional and Logic Programming Language based on Constructor Discipline and Narrowingby: Juan José Moreno-Navarro, Mario Rodríguez-Artalejo
- Narrowing with Built-In Theoriesby: Alexander Bockmayr
- Narrowing and Resolution in Logic-Functional programming Languages (Abstract)by: Elio Giovannetti
- Integrating Logic Programming and Equational Specification of Abstract Data Typesby: Christoph Beierle, Udo Pletat
- An Effective Method for Handling Initial Algebrasby: Hubert Comon
- Functional Extensions to Prolog: Are they Needed?by: Laurent Fribourg
- A New Quasi-Reducibility Testing Algorithm and its Application to Proofs by Inductionby: Gregory Kucherov
- Modular Algebraic Specificationsby: Horst Hansen, Michael Löwe
- Logic Programming with Polymorphically Order-Sorted Typesby: Gert Smolka
- Types, Modularisation and Abstraction in Logic Programmingby: George Dayantis
- Translating Algebraic Specifications to Prolog Programs: A Comparative Studyby: Klaus Drosten
- Rewrite Rule Systems for Modal Propositional Logicby: Annie Foret
- A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automataby: Zoltán Fülöp, Sándor Vágvölgyi
- Functional Data Term Models and Semantic Unificationby: Hans-Joachim Goltz
- Jungle Evaluation for Efficient Term Rewritingby: Berthold Hoffmann, Detlef Plump
- Nonstandard Logics of Recursive Programs and Denotational Semanticsby: Ana Pasztor
![[SWISH++]](/docis/swish-powered.gif){kind=small}
