Del i serien Lecture Notes in Computer Science

Term Rewriting and Applications

18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings

Häftad, Engelska, 2007

749 kr

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

The 18th International Conference on Rewriting Techniques and Applications, held in Paris, France in June 2007, featured presentations and discussions centering on some of the latest advances in the field. This volume presents the proceedings from that meeting. Papers cover current research on all aspects of rewriting, including applications, foundational issues, frameworks, implementations, and semantics.

Produktinformation

Utgivningsdatum2007-06-21
Mått155 x 235 x 24 mm
Vikt657 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor422
Upplaga2007
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540734475

Tillhör följande kategorier

Programspråk inom Data och IT

Formal Verification of an Optimizing Compiler.- Challenges in Satisfiability Modulo Theories.- On a Logical Foundation for Explicit Substitutions.- Intruders with Caps.- Tom: Piggybacking Rewriting on Java.- Rewriting Approximations for Fast Prototyping of Static Analyzers.- Determining Unify-Stable Presentations.- Confluence of Pattern-Based Calculi.- A Simple Proof That Super-Consistency Implies Cut Elimination.- Bottom-Up Rewriting Is Inverse Recognizability Preserving.- Adjunction for Garbage Collection with Application to Graph Rewriting.- Non Strict Confluent Rewrite Systems for Data-Structures with Pointers.- Symbolic Model Checking of Infinite-State Systems Using Narrowing.- Delayed Substitutions.- Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems.- Termination of Rewriting with Right-Flat Rules.- Abstract Critical Pairs and Confluence of Arbitrary Binary Relations.- On the Completeness of Context-Sensitive Order-Sorted Specifications.- KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis.- Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi.- Proving Termination of Rewrite Systems Using Bounds.- Sequence Unification Through Currying.- The Termination Competition.- Random Descent.- Correctness of Copy in Calculi with Letrec.- A Characterization of Medial as Rewriting Rule.- The Maximum Length of Mu-Reduction in Lambda Mu-Calculus.- On Linear Combinations of ?-Terms.- Satisfying KBO Constraints.- Termination by Quasi-periodic Interpretations.

Du kanske också är intresserad av

Franz von Baader's sämtliche Werke

Franz Baader

Häftad, 2016

819 kr

The Description Logic Handbook

Franz Baader, Diego Calvanese, Deborah L. McGuinness, Daniele Nardi, Peter F. Patel-Schneider

Häftad, 2010

1 449 kr

An Introduction to Description Logic

Franz Baader, Ian Horrocks, Carsten Lutz, Uli Sattler

Inbunden, 2017

1 669 kr

Fermenta Cognitionis, Heft 1.

Franz Baader

Inbunden, 1822

2 089 kr

Philosophische Schriften

Johann Caspar Bluntschli, Franz Hoffmann, Franz Baader

Häftad, 2016

709 kr

An Introduction to Description Logic

Franz Baader, Ian Horrocks, Carsten Lutz, Uli Sattler

Häftad, 2017

919 kr

Term Rewriting and All That

Franz Baader, Tobias Nipkow

Häftad, 1999

1 099 kr

Philosophische Schriften

Franz Hoffmann, Franz Baader

Häftad, 2016

709 kr

KI 2001: Advances in Artificial Intelligence

Franz Baader, Gerhard Brewka, Thomas Eiter

Häftad, 2001

749 kr

Franz von Baaders sämtliche Werke

Franz Baader

Häftad, 2017

759 kr

Del i serien Lecture Notes in Computer Science

Term Rewriting and Applications

18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings

Häftad, Engelska, 2007

AvFranz Baader

749 kr

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

Produktinformation

Utgivningsdatum2007-06-21
Mått155 x 235 x 24 mm
Vikt657 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor422
Upplaga2007
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540734475

Tillhör följande kategorier

Programspråk inom Data och IT

Formal Verification of an Optimizing Compiler.- Challenges in Satisfiability Modulo Theories.- On a Logical Foundation for Explicit Substitutions.- Intruders with Caps.- Tom: Piggybacking Rewriting on Java.- Rewriting Approximations for Fast Prototyping of Static Analyzers.- Determining Unify-Stable Presentations.- Confluence of Pattern-Based Calculi.- A Simple Proof That Super-Consistency Implies Cut Elimination.- Bottom-Up Rewriting Is Inverse Recognizability Preserving.- Adjunction for Garbage Collection with Application to Graph Rewriting.- Non Strict Confluent Rewrite Systems for Data-Structures with Pointers.- Symbolic Model Checking of Infinite-State Systems Using Narrowing.- Delayed Substitutions.- Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems.- Termination of Rewriting with Right-Flat Rules.- Abstract Critical Pairs and Confluence of Arbitrary Binary Relations.- On the Completeness of Context-Sensitive Order-Sorted Specifications.- KOOL: An Application of Rewriting Logic to Language Prototyping and Analysis.- Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi.- Proving Termination of Rewrite Systems Using Bounds.- Sequence Unification Through Currying.- The Termination Competition.- Random Descent.- Correctness of Copy in Calculi with Letrec.- A Characterization of Medial as Rewriting Rule.- The Maximum Length of Mu-Reduction in Lambda Mu-Calculus.- On Linear Combinations of ?-Terms.- Satisfying KBO Constraints.- Termination by Quasi-periodic Interpretations.