Algebraic and Logic Programming
Editat de Jan Grabowski, Pierre Lescanne, Wolfgang Wechleren Limba Engleză Paperback – 4 iul 1989
Preț: 321.36 lei
Preț vechi: 401.70 lei
-20%
Puncte Express: 482
Carte tipărită la comandă
Livrare economică 11-25 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540506676
ISBN-10: 3540506675
Pagini: 284
Ilustrații: IX, 269 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.44 kg
Ediția:1988
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540506675
Pagini: 284
Ilustrații: IX, 269 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.44 kg
Ediția:1988
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.