Algebraic and Logic Programming
International Workshop, Gaussig, GDR, November 14-18, 1988. Proceedings
Published on 4. July 1989
Book
Paperback/Softback
IX, 269 pages
978-3-540-50667-6 (ISBN)
Description
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.
More details
Series
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
IX, 269 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 16 mm
Weight
435 gr
ISBN-13
978-3-540-50667-6 (9783540506676)
DOI
10.1007/3-540-50667-5
Schweitzer Classification
Content
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.