Algebraic and Logic Programming

International Workshop, Gaussig, GDR, November 14-18, 1988. Proceedings

Jan Grabowski, Pierre Lescanne, Wolfgang Wechler (Herausgeber)

Buch | Softcover

IX, 269 Seiten

1989
Springer Berlin (Verlag)
978-3-540-50667-6 (ISBN)

Artikel merken

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.

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.

Erscheint lt. Verlag	4.7.1989
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	IX, 269 p.
Verlagsort	Berlin
Sprache	englisch
Maße	163 x 242 mm
Gewicht	456 g
Themenwelt	Mathematik / Informatik ► Informatik ► Betriebssysteme / Server
Schlagworte	algorithm • algorithms • Automat • Automata • fuzzy • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Logic • Logik • Logische Programmierung • Programmierung • programming • Programming language • proving • Resolution • Semantics
ISBN-10	3-540-50667-5 / 3540506675
ISBN-13	978-3-540-50667-6 / 9783540506676
Zustand	Neuware