FEEDBACK Smiley face
Normal view MARC view ISBD view

Rewriting Techniques and Applications [electronic resource] :13th International Conference, RTA 2002 Copenhagen, Denmark, July 22–24, 2002 Proceedings /

Contributor(s): Tison, Sophie [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 2378Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2002.Description: XII, 392 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540456100.Subject(s): Computer science | Computer programming | Programming languages (Electronic computers) | Computer logic | Mathematical logic | Computer science -- Mathematics | Artificial intelligence | Computer Science | Programming Techniques | Mathematical Logic and Formal Languages | Logics and Meanings of Programs | Programming Languages, Compilers, Interpreters | Artificial Intelligence (incl. Robotics) | Symbolic and Algebraic ManipulationOnline resources: Click here to access online
Contents:
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 Böhm 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.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

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 Böhm 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.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in