Conditional and Typed Rewriting Systems: 2nd International CTRS Workshop, Montreal, Canada, June 11-14, 1990. Proceedings: Lecture Notes in Computer Science, cartea 516
Editat de Stephane Kaplan, Mitsuhiro Okadaen Limba Engleză Paperback – 7 aug 1991
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 341.81 lei
Preț vechi: 427.26 lei
-20% Nou
Puncte Express: 513
Preț estimativ în valută:
65.41€ • 68.46$ • 54.44£
65.41€ • 68.46$ • 54.44£
Carte tipărită la comandă
Livrare economică 31 martie-14 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540543176
ISBN-10: 3540543171
Pagini: 484
Ilustrații: X, 464 p.
Dimensiuni: 155 x 233 x 25 mm
Greutate: 0.68 kg
Ediția:1991
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540543171
Pagini: 484
Ilustrații: X, 464 p.
Dimensiuni: 155 x 233 x 25 mm
Greutate: 0.68 kg
Ediția:1991
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Conditional rewriting in focus.- A maximal-literal unit strategy for horn clauses.- Extended term rewriting systems.- A proof system for conditional algebraic specifications.- Conditional rewriting logic: Deduction, models and concurrency.- Equivalences of rewrite programs.- On finite representations of infinite sequences of terms.- Infinite terms and infinite rewritings.- Testing confluence of nonterminating rewriting systems.- A survey of ordinal interpretations of type ?0 for termination of rewriting systems.- Meta-rule synthesis from crossed rewrite systems.- An application of automated equational reasoning to many-valued logic.- Completion of first-order clauses with equality by strict superposition.- Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation.- Proof by consistency in conditional equational theories.- Completion procedures as semidecision procedures.- Errata corrige.- Linear completion.- Clausal rewriting.- Adding algebraic rewriting to the calculus of constructions : Strong normalization preserved.- On sufficient completeness of conditional specifications.- FPL : Functional plus logic programming an integration of the FP and Prolog languages.- Confluence of the disjoint union of conditional term rewriting systems.- Implementing term rewriting by graph reduction: Termination of combined systems.- Compiling concurrent rewriting onto the Rewrite Rule Machine.- Design strategies for rewrite rules.- A simplifier for untyped lambda expressions.- Parallel graph rewriting on loosely coupled machine architectures.- Typed equivalence, type assignment, and type containment.- A fixed-point semantics for feature type systems.- Unique-sort order-sorted theories : A description as monad morphisms.- Equational logics(birkhoff's method revisited).- Compatibility of order-sorted rewrite rules.- An universal termination condition for solving goals in equational languages.- Constrained equational deduction.- Higher-order unification, polymorphism, and subsorts.- Second-order unification in the presence of linear shallow algebraic equations.- An inference system for horn clause logic with equality.