Vor Ort
Merkzettel Warenkorb
  • Produktbild: Conditional and Typed Rewriting Systems
  • Produktbild: Conditional and Typed Rewriting Systems
Band 516

Conditional and Typed Rewriting Systems 2nd International CTRS Workshop, Montreal, Canada, June 11-14, 1990. Proceedings

Aus der Reihe Lecture Notes in Computer Science

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

07.08.1991

Abbildungen

X, 464 p.

Herausgeber

Stephane Kaplan + weitere

Verlag

Springer Berlin

Seitenzahl

464

Maße (L/B/H)

23,5/15,5/2,7 cm

Gewicht

727 g

Auflage

1991

Sprache

Englisch

ISBN

978-3-540-54317-6

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

07.08.1991

Abbildungen

X, 464 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

464

Maße (L/B/H)

23,5/15,5/2,7 cm

Gewicht

727 g

Auflage

1991

Sprache

Englisch

ISBN

978-3-540-54317-6

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Conditional and Typed Rewriting Systems
  • Produktbild: Conditional and Typed Rewriting Systems
  • 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.