Rewriting Techniques and Applications

Dijon, France, May 20-22, 1985

AvJean-Pierre Jouannaud

Häftad, Engelska, 1985

Del i serien Lecture Notes in Computer Science

459 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

First International Conference on Rewriting Techniques and Applications

Produktinformation

Utgivningsdatum:1985-10-01
Mått:155 x 235 x undefined mm
Vikt:680 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:444
Upplaga:1985
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540159766

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

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.

Du kanske också är intresserad av

Nyhet

L’amour toujours : Berättelsen om Tidö

Maggie Strömberg, Torbjörn Nilsson

Inbunden, 2026

275 kr

Conditional Term Rewriting Systems

Stephane Kaplan, Jean-Pierre Jouannaud

Häftad, 1988

572 kr

Certified Programs and Proofs

Jean-Pierre Jouannaud, Zhong Shao

Häftad, 2011

572 kr

Constraints in Computational Logics

Jean-Pierre Jouannaud

Häftad, 1994

556 kr

Algebra, Meaning, and Computation

Jose Meseguer, Jean-Pierre Jouannaud, Kokichi Futatsugi

E-bok

2006

1 470 kr

Term Rewriting

Hubert Comon, Jean-Pierre Jouannaud

Häftad, 1995

572 kr

Certified Programs and Proofs

Zhong Shao, Jean-Pierre Jouannaud

E-bok

2011

739 kr

Functional Programming Languages and Computer Architecture

Jean-Pierre Jouannaud

Häftad, 1985

572 kr

TAPSOFT '93: Theory and Practice of Software Development

Marie-Claude Gaudel, Jean-Pierre Jouannaud

Häftad, 1993

1 138 kr

Algebra, Meaning, and Computation

Kokichi Futatsugi, Jean-Pierre Jouannaud, José Meseguer

Häftad, 2006

1 105 kr

Rewriting Techniques and Applications

Dijon, France, May 20-22, 1985

AvJean-Pierre Jouannaud

Häftad, Engelska, 1985

Del i serien Lecture Notes in Computer Science

459 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

First International Conference on Rewriting Techniques and Applications

Produktinformation

Utgivningsdatum:1985-10-01
Mått:155 x 235 x undefined mm
Vikt:680 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:444
Upplaga:1985
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540159766

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

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.