Verkauf durch Sack Fachmedien

Jouannaud

Rewriting Techniques and Applications

Dijon, France, May 20-22, 1985

Medium: Buch
ISBN: 978-3-540-15976-6
Verlag: Springer
Erscheinungstermin: 01.10.1985
Lieferfrist: bis zu 10 Tage

First International Conference on Rewriting Techniques and Applications


Produkteigenschaften


  • Artikelnummer: 9783540159766
  • Medium: Buch
  • ISBN: 978-3-540-15976-6
  • Verlag: Springer
  • Erscheinungstermin: 01.10.1985
  • Sprache(n): Englisch
  • Auflage: 1985
  • Serie: Lecture Notes in Computer Science
  • Produktform: Kartoniert, Paperback
  • Gewicht: 1390 g
  • Seiten: 444
  • Format (B x H x T): 155 x 235 x 25 mm
  • Ausgabetyp: Kein, Unbekannt
Autoren/Hrsg.

Herausgeber

Basic features and development of the critical-pair/completion procedure.- Contextual rewriting.- Thue systems as rewriting systems.- Deciding algebraic properties of monoids presented by finite church-rosser Thue systems.- Two applications of equational theories to database theory.- An experiment in partial evaluation: The generation of a compiler generator.- NARROWER: a new algorithm for unification and its application to Logic Programming.- Solving type equations by graph rewriting.- Termination.- Path of subterms ordering and recursive decomposition ordering revisited.- Associative path orderings.- A procedure for automatically proving the termination of a set of rewrite rules.- Petrireve: Proving Petri net properties with rewriting systems.- Fairness in term rewriting systems.- Two results in term rewriting theorem proving.- Handling function definitions through innermost superposition and rewriting.- An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras.- Combining unification algorithms for confined regular equational theories.- An algebraic approach to unification under associativity and commutativity.- Unification problems with one-sided distributivity.- Fast many-to-one matching algorithms.- Complexity of matching problems.- The set of unifiers in typed ?-calculus as regular expression.- Equational systems for category theory and intuitionistic logic.