- Format
- Häftad (Paperback / softback)
- Språk
- Engelska
- Antal sidor
- 392
- Utgivningsdatum
- 2002-07-01
- Upplaga
- 2002 ed.
- Förlag
- Springer-Verlag Berlin and Heidelberg GmbH & Co. K
- Medarbetare
- Tison, Sophie (ed.)
- Illustrationer
- XII, 392 p.
- Volymtitel
- 13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002 - Proceedings
- Dimensioner
- 279 x 216 x 21 mm
- Vikt
- Antal komponenter
- 1
- Komponenter
- 1 Paperback / softback
- ISBN
- 9783540439165
- 931 g
Du kanske gillar
-
Life's Edge
Carl Zimmer
HäftadOn Fire
Naomi Klein
HäftadRewriting Techniques and Applications
13th International Conference, RTA 2002, Copenhagen, Denmark, July 22-24, 2002 Proceedings
av Sophie Tison1177- Skickas inom 7-10 vardagar.
- Gratis frakt inom Sverige över 199 kr för privatpersoner.
Finns även somPassar bra ihop
De som köpt den här boken har ofta också köpt Transcendence av Gaia Vince (häftad).
Köp båda 2 för 1206 krKundrecensioner
Har du läst boken? Sätt ditt betyg »Fler böcker av Sophie Tison
-
STACS 2000
Horst Reichel, Sophie Tison
-
STACS 99
Christoph Meinel, Sophie Tison
-
Trees in Algebra and Programming - CAAP '94
Sophie Tison
Innehållsförteckning
Invited Talks.- Combining Shostak Theories.- Multiset Rewriting and Security Protocol Analysis.- Engineering of Logics for the Content-Based Representation of Information.- Regular Papers, Application Papers.- Axiomatic Rewriting Theory VI: Residual Theory Revisited.- Static Analysis of Modularity of ?-Reduction in the Hyperbalanced ?-Calculus.- Exceptions in the Rewriting Calculus.- Deriving Focused Lattice Calculi.- Layered Transducing Term Rewriting System and Its Recognizability Preserving Property.- Decidability and Closure Properties of Equational Tree Languages.- Regular Sets of Descendants by Some Rewrite Strategies.- Rewrite Games.- An Extensional Boehm Model.- A Weak Calculus with Explicit Operators for Pattern Matching and Substitution.- Tradeoffs in the Intensional Representation of Lambda Terms.- Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae.- Conditions for Efficiency Improvement by Tree Transducer Composition.- Rewriting Strategies for Instruction Selection.- Probabilistic Rewrite Strategies. Applications to ELAN.- Loops of Superexponential Lengths in One-Rule String Rewriting.- Recursive Derivational Length Bounds for Confluent Term Rewrite Systems Research Paper.- Termination of (Canonical) Context-Sensitive Rewriting.- Atomic Set Constraints with Projection.- Currying Second-Order Unification Problems.- A Decidable Variant of Higher Order Matching.- Combining Decision Procedures for Positive Theories Sharing Constructors.- System Descriptions.- JITty: A Rewriter with Strategy Annotations.- Autowrite: A Tool for Checking Properties of Term Rewriting Systems.- TTSLI: An Implementation of Tree-Tuple Synchronized Languages.- in2: A Graphical Interpreter for Interaction Nets.