重写技术与应用 Rewriting techniques and applications
点此进入淘宝搜索页搜索分類: 图书,进口原版书,科学与技术 Science & Techology ,
作者： Aart Middeldorp 著
出 版 社： 湖南文艺出版社
出版时间： 2002-12-1字数：版次： 1页数： 361印刷时间： 2001/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540421177包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science resarch forum available.
The scope of LNCS, including its subseries LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material publised traditionally includes.
-proceedings(published in time for the respective conference)
-post-proceedings(consisting of thoroughly revised final full papers)
-research monographs(which may be basde on outstanding PhD work, research projects, technical reports, etc.)
内容简介
This book constitutes the refereed proceedings of the 12th International Conference on Rewriting Techniques and Applications, RTA 2001, held in Utrecht, The Netherlands, in May 2001.The 23 revised full papers presented together with two system descriptions were carefully reviewed and selected from 55 submissions. All current aspects of rewriting are addressed.
目录
Invited Talks
Computing and Proving
Rewriting for Deduction and Verification
Regular Papers
Universal Interaction Systems with Only Two Agents
General Recursion on Second Order Term Algebras
Beta Reduction Constraints
From Higher-Order to First-Order Rewriting
Combining Pattern E-Unification Algorithms
Matching Power
Dependency Pairs for Equational Rewriting
Termination Proofs by Context-Dependent Interpretations
Uniform Normalisation beyond Orthogonality
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order...
Relating Accumulative and Non-accumulative Functional Programs
Context Unification and Traversal Equations
Weakly Regular Relations and Applications
On the Parallel Complexity of Tree Automata
Transfinite Rewriting Semantics for Term Rewriting Systems
Goal-Directed E-Unification
The Unification Problem for Confluent Right-Ground Term Rewriting Systems
On Termination of Higher-Order Rewriting
Matching with Free Function Symbols-A Simple Extension of Matching?
Deriving Focused Calculi for Transitive Relations
A Formalised First-Order Confluence Proof for the A-Calculus Using One-Sorted Variable Names ( Barendregt Was Right after all ... almost)
A Normal Form for Church-Rosser Language Systems
Confluence and Termination of Simply Typed Term Rewriting Systems ...
System Descriptions
Parallel Evaluation of Interaction Nets with MPINE
Stratego: A Language for Program Transformation Based on Rewriting Strategies (System Description of Stratego 0.5)
Author Index
