Algebraic and Logic Programming

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.- 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 term models and semantic unification.-Modular algebraic specifications.- Proving inductive theorems based on term rewriting systems.- Jungle evaluation for efficient term rewriting.- A new quasi-reducibility testing algorithm and its application to proofs by induction.- Fuzzy reasoning based on f-horn clause rules.- Babel: A functional and logic programming language based on constructor discipline and narrowing.- Refined compilation of pattern-matching for functional languages.- Narrowing in partial conditional equational theories.- Solving equations in an equational language.- Nonstandard logics of recursive programs and denotational semantics.