Del i serien Lecture Notes in Computer Science

Rewriting Techniques and Applications

Bordeaux, France, May 25-27, 1987. Proceedings

Häftad, Engelska, 1987

519 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987.

Produktinformation

Utgivningsdatum1987-05-14
Mått155 x 235 x 17 mm
Vikt452 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor288
Upplaga1987
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540172208

Tillhör följande kategorier

Operativsystem inom Data och IT

Term-rewriting implementation of equational logic programming.- Optimizing equational programs.- A compiler for conditional term rewriting systems.- How to choose the weights in the Knuth Bendix ordering.- Detecting looping simplifications.- Combinatorial hypermap rewriting.- The word problem for finitely presented monoids and finite canonical rewriting systems.- Term rewriting systems with priorities.- A gap between linear and non linear term-rewriting systems.- Code generator generation based on template-driven target term rewriting.- Descendants of regular language in a class of rewriting systems: Algorithm and complexity of an automata construction.- Groups presented by certain classes of finite length-reducing string-rewriting systems.- Some results about confluence on a given congruence class.- Ground confluence.- Structured contextual rewriting.- Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes.- Completion for rewriting modulo a congruence.- On equational theories, unification and decidability.- A general complete E-unification procedure.- Improving basic narrowing techniques.- Strategy-controlled reduction and narrowing.- Algorithmic complexity of term rewriting systems.- Optimal speedups for parallel pattern matching in trees.

Du kanske också är intresserad av

Romulo

Beth Day Romulo

Häftad, 1987

549 kr

Algebraic and Logic Programming

Jan Grabowski, Pierre Lescanne, Wolfgang Wechler

Häftad, 1989

749 kr

Women in the Medieval English Countryside

Judith M. Bennett

Inbunden, 1987

1 029 kr

Unlikely Heroines

Ann R. Shapiro

Inbunden, 1987

1 259 kr

Management Theory and Library Education.

Sajjad ur Rehman

Inbunden, 1987

1 439 kr

Ten Men Dead

David Beresford

Häftad, 1987

209 kr

Industriebetriebliche Energienutzung und Produktionsplanung

Johannes Wolf

Häftad, 1987

769 kr

Zentrale und dezentrale Energieversorgung

Helmut Schaefer

Häftad, 1987

1 079 kr

Del 49

Algebraic and Logic Programming

Jan Grabowski, Pierre Lescanne, Wolfgang Wechler

Inbunden, 1989

2 409 kr

Algebraic System Specification and Development

Michel Bidoit, Hans-Jörg Kreowski, Pierre Lescanne, Fernando Orejas, Donald Sannella

Häftad, 1991

729 kr

Del i serien Lecture Notes in Computer Science

Rewriting Techniques and Applications

Bordeaux, France, May 25-27, 1987. Proceedings

Häftad, Engelska, 1987

AvPierre Lescanne

519 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This volume contains the proceedings of the Second International Conference on Rewriting Techniques and Applications, "RTA 87", held in Bordeaux, France, May 1987.

Produktinformation

Utgivningsdatum1987-05-14
Mått155 x 235 x 17 mm
Vikt452 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor288
Upplaga1987
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540172208

Tillhör följande kategorier

Operativsystem inom Data och IT

Term-rewriting implementation of equational logic programming.- Optimizing equational programs.- A compiler for conditional term rewriting systems.- How to choose the weights in the Knuth Bendix ordering.- Detecting looping simplifications.- Combinatorial hypermap rewriting.- The word problem for finitely presented monoids and finite canonical rewriting systems.- Term rewriting systems with priorities.- A gap between linear and non linear term-rewriting systems.- Code generator generation based on template-driven target term rewriting.- Descendants of regular language in a class of rewriting systems: Algorithm and complexity of an automata construction.- Groups presented by certain classes of finite length-reducing string-rewriting systems.- Some results about confluence on a given congruence class.- Ground confluence.- Structured contextual rewriting.- Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes.- Completion for rewriting modulo a congruence.- On equational theories, unification and decidability.- A general complete E-unification procedure.- Improving basic narrowing techniques.- Strategy-controlled reduction and narrowing.- Algorithmic complexity of term rewriting systems.- Optimal speedups for parallel pattern matching in trees.