Algebraic and Logic Programming : : Proceedings of an International Workshop held in Gaussig (GDR), November 14–18, 1988 / / ed. by Jan Grabowski, Wolfgang Wechler, Pierre Lescanne.

• MitwirkendeR: Beierle, Christoph,; Bergstra, J.A,; Bockmayr, Alexander,; Bousdira, Wadoud,; Comon, Hubert,; Dahn, Bernd I.,; Dayantis, George,; Drosten, K.,; Ffllop, Z.,; Foret, Annie,; Fribourg, Laurent,; Giovannetti, Elio,; Goltz, Hans-Joachim,; Hansen, Horst,; Hofbauer, Dieter,; Hoffmann, Berthold,; Hussmarm, Heinrich,; Jouannaud, Jean-Pierre,; Kirchner, Claude,; Kirchner, Hélène,; Kucherov, G.A,; Kutsche, Ralf-Detlef,; Li, Deyi,; Liu, Dongbo,; Löwe, Michael,; Moreno-Navarro, Juan José,; Pasztor, Ana,; Pietät, Udo,; Plump, Detlef,; Rodríguez-Artalejo, Mario,; Schnoebelen, Ph,; Smolka, Geit,; Vagvolgyi, S.,; Wolter, Uwe,; You, Jia-Huai,
• HerausgeberIn: Grabowski, Jan,; Lescanne, Pierre,; Wechler, Wolfgang,
• Place / Publishing House: Berlin ;, Boston : : De Gruyter, , [2022]; ©1988
• Year of Publication: 2022
• Edition: Reprint 2022
• Language: English
• Series: Mathematical Research : Mathematische Forschung ; 49
• Physical Description: 1 online resource (284 p.)

Table of Contents

• Frontmatter
• Preface
• Contents
• INVITED PAPERS
• ACP WITH SIGNALS
• FUNCTIONAL EXTENSIONS TO PROLOG: ARE THEY NEEDED?
• NARROWING AND RESOLUTION IN LOGIC-FUNCTIONAL PROGRAMMING LANGUAGES
• Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting
• OBJ: Programming with Equalities, Subsorts, Overloading and Parameterization
• Logic Programming with Polymorphically Order-Sorted Types
• SUBMITTED PAPERS
• Integrating Logic Programming and Equational Specification of Abstract Data Types
• NARROWING WITH BUILT-IN THEORIES
• A completion procedure for hierarchical conditional rewriting systems
• An effective method for handling initial algebras
• BOOLEAN VALUED MODELS AND INCOMPLETE SPECIFICATIONS
• TYPES, MODULARISATION AND ABSTRACTION IN LOGIC PROGRAMMING
• TRANSLATING ALGEBRAIC SPECIFICATIONS TO PROLOG PROGRAMS: A COMPARATIVE STUDY
• Rewrite Rule Systems for Modal Propositional Logic
• A CHARACTERIZATION OF IRREDUCIBLE SETS MODULO LEFT-LINEAR TERM REWRITING SYSTEMS BY TREE AUTOMATA
• FUNCTIONAL DATA TEBM MODELS AND SEMANTIC UNIFICATION
• MODULAR ALGEBRAIC SPECIFICATIONS
• PROVING INDUCTIVE THEOREMS BASED ON TERM REWRITING SYSTEMS
• Jungle Evaluation for Efficient Term Rewriting
• A NEW QUASI-REDUCTIBILITY TESTING ALGORITHM AND ITS APPLICATION TO PROOFS BY INDUCTION
• FUZZY REASONING BASED ON f-HORN CLAUSE RULES
• BABEL: A Functional and Logic Programing Language based on constructor discipline and narrowing
• Refined Compilation of Pattern-Matching for Functional Languages
• NARROWING IN PARTIAL CONDITONAL EQUATIONAL THEORIES
• SOLVING EQUATIONS IN AN EQUATIONAL LANGUAGE
• NONSTANDARD LOGICS OF RECURSIVE PROGRAMS AND DENOTATIONAL SEMANTICS
• Backmatter