This volume contains the proceedings of the First International Workshop on Algebraic and Logic Programming held in Gaussig (German Democratic Republic) from November 14 to 18, 1988. The workshop was devoted to Algebraic Programming, in the sense of programming by algebraic specifications and rewrite rule systems, and Logic Programming, in the sense of Horn clause specifications and resolution systems. This includes combined algebraic/logic programming systems, mutual relations and mutual implementation of programming paradigms, completeness and efficiency considerations in both fields, as well as related topics.
Author(s): J. A. Bergstra (auth.), J. Grabowski, P. Lescanne, W. Wechler (eds.)
Series: Lecture Notes in Computer Science 343
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1988
Language: English
Pages: 283
Tags: Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Programming Techniques; Artificial Intelligence (incl. Robotics)
ACP with signals....Pages 11-20
Functional extensions to prolog: Are they needed?....Pages 21-29
Narrowing and resolution in logic-functional programming languages....Pages 30-30
Nondeterministic algebraic specifications and nonconfluent term rewriting....Pages 31-40
OBJ: Programming with equalities, subsorts, overloading and parameterization....Pages 41-52
Logic programming with polymorphically order-sorted types....Pages 53-70
Integrating logic programming and equational specification of abstract data types....Pages 71-82
Narrowing with built-in theories....Pages 83-92
A completion procedure for hierarchical conditional rewriting systems....Pages 93-107
An effective method for handling initial algebras....Pages 108-118
Boolean valued models and incomplete specifications....Pages 119-126
Types, modularisation and abstraction in logic programming....Pages 127-136
Translating algebraic specifications to Prolog programs: A comparative study....Pages 137-146
Rewrite rule systems for modal propositional logic....Pages 147-156
A characterization of irreducible sets modulo left-linear term rewriting systems by tree automata....Pages 157-157
Functional data term models and semantic unification....Pages 158-167
Modular algebraic specifications....Pages 168-179
Proving inductive theorems based on term rewriting systems....Pages 180-190
Jungle evaluation for efficient term rewriting....Pages 191-203
A new quasi-reducibility testing algorithm and its application to proofs by induction....Pages 204-213
Fuzzy reasoning based on f-horn clause rules....Pages 214-222
Babel: A functional and logic programming language based on constructor discipline and narrowing....Pages 223-232
Refined compilation of pattern-matching for functional languages....Pages 233-243
Narrowing in partial conditional equational theories....Pages 244-244
Solving equations in an equational language....Pages 245-254
Nonstandard logics of recursive programs and denotational semantics....Pages 255-278
