Cantitate/Preț
Produs

Algebraic and Logic Programming: International Workshop, Gaussig, GDR, November 14-18, 1988. Proceedings: Lecture Notes in Computer Science, cartea 343

Editat de Jan Grabowski, Pierre Lescanne, Wolfgang Wechler
en Limba Engleză Paperback – 4 iul 1989
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32506 lei

Preț vechi: 40632 lei
-20% Nou

Puncte Express: 488

Preț estimativ în valută:
6220 6544$ 5150£

Carte tipărită la comandă

Livrare economică 14-28 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540506676
ISBN-10: 3540506675
Pagini: 284
Ilustrații: IX, 269 p.
Dimensiuni: 163 x 242 x 15 mm
Greutate: 0.4 kg
Ediția:1988
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.