Algebraic and Logic Programming
Editat de Helene Kirchner, Giorgio Levien Limba Engleză Paperback – 19 aug 1992
Preț: 330.96 lei
Preț vechi: 413.70 lei
-20%
Puncte Express: 496
Preț estimativ în valută:
58.52€ • 67.11$ • 50.58£
58.52€ • 67.11$ • 50.58£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540558736
ISBN-10: 354055873X
Pagini: 472
Ilustrații: IX, 460 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.71 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354055873X
Pagini: 472
Ilustrații: IX, 460 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.71 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Outline of an object-oriented calculus of higher type.- High-level-replacement systems for equational algebraic specifications.- Termination of rewrite systems by elementary interpretations.- Termination of order-sorted rewriting.- Generalized sufficient conditions for modular termination of rewriting.- A theory of first-order built-in's of prolog.- Fixpoint semantics for partial computed answer substitutions and call patterns.- Oracle semantics for Prologa.- On the relation between primitive recursion, schematization, and divergence.- Term rewriting with sharing and memoïzation.- Definitional trees.- Multiparadigm logic programming.- Non-linear real constraints in constraint logic programming.- A general scheme for constraint functional logic programming.- Incremental rewriting in narrowing derivations.- Counterexamples to completeness results for basic narrowing (extended abstract).- Uniform narrowing strategies.- Proof by consistency in constructive systems with final algebra semantics.- A fast algorithm for ground normal form analysis.- Eta-conversion for the languages of explicit substitutions.- Serialisation analysis of concurrent logic programs.- Implementation of a toolset for prototyping algebraic specifications of concurrent systems.- Axiomatizing permutation equivalence in the ?-calculus.- A CLP view of logic programming.- Partial deduction of logic programs WRT well-founded semantics.- The finiteness of logic programming derivations.- Theorem proving for hierarchic first-order theories.- A goal oriented strategy based on completion.- On n-syntactic equational theories.