1 option
Rewriting Techniques and Applications : 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings / edited by Tobias Nipkow.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1379.
- Lecture Notes in Computer Science, 0302-9743 ; 1379
- Language:
- English
- Subjects (All):
- Programming languages (Electronic computers).
- Logic, Symbolic and mathematical.
- Computer logic.
- Artificial intelligence.
- Programming Languages, Compilers, Interpreters.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Artificial Intelligence.
- Mathematical Logic and Foundations.
- Local Subjects:
- Programming Languages, Compilers, Interpreters.
- Mathematical Logic and Formal Languages.
- Logics and Meanings of Programs.
- Artificial Intelligence.
- Mathematical Logic and Foundations.
- Physical Description:
- 1 online resource (X, 346 pages).
- Edition:
- First edition 1998.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
- System Details:
- text file PDF
- Summary:
- This book constitutes the refereed proceedings of the 9th International Conference on Rewriting Techniques and Applications, RTA-98, held in Tsukuba, Japan, in March/April 1998. The 22 revised full papers presented were carefully selected from a total of 61 submissions by the program committee with the assistance of 113 additional referees. The book covers all current aspects of rewriting including rewriting systems, term rewriting, string rewriting, theorem proving, resolution, normalization, unification, equational logics, lambda calculus, constraint solving, and functional programming.
- Contents:
- Origin tracking in term rewriting
- Simultaneous critical pairs and Church-Rosser property
- Church-Rosser theorems for abstract reduction modulo an equivalence relation
- Automatic monoids versus monoids with finite convergent presentations
- Decidable and undecidable second-order unification problems
- On the exponent of periodicity of minimal solutions of context equations
- Unification in extensions of shallow equational theories
- Unification and matching in process algebras
- E-unification for subsystems of S4
- Solving disequations modulo some class of rewrite systems
- About proofs by consistency
- Normalization of S-terms is decidable
- Decidable approximations of sets of descendants and sets of normal forms
- Algorithms and reductions for rewriting problems
- The decidability of simultaneous rigid E-unification with one variable
- Ordering constraints over feature trees expressed in second-order monadic logic
- Co-definite set constraints
- Modularity of termination using dependency pairs
- Termination of associative-commutative rewriting by dependency pairs
- Termination transformation by tree lifting ordering
- Towards automated termination proofs through "freezing"
- Higher-order rewriting and partial evaluation
- SN combinators and partial combinatory algebras
- Coupling saturation-based provers by exchanging positive/negative information
- An on-line problem database.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-69721-3
- 9783540697213
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.