项重写与应用： RTA 2006 第17届国际会议/会议录 Term rewriting and applications
点此进入淘宝搜索页搜索分類: 图书,计算机/网络,程序设计,其他,
作者： Frank Pfenning 著
出 版 社： 湖北辞书出版社
出版时间： 2006-12-1字数：版次： 1页数： 414印刷时间： 2006/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540368342包装： 平装编辑推荐
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 17th International Conference on Rewriting Techniques and Applications, RTA 2006, held in Seattle, WA, USA in August 2006 within the scope of FLoC 2006, the 2006 Federated Logic Conference.
The 23 revised full papers and 4 systems description papers carefully reviewed and selected from 52 initial submissions are presented together with 2 invited talks and a plenary talk of the hosting FLoC conference. The papers are organized in topical sections on constraints and optimization, equational reasoning, system verification, lambda calculus, theorem proving, system descriptions, termination, and higher-order rewriting and unification.
目录
FLoC Plenary Talk
Formal Verification of Infinite State Systems Using Boolean Methods
Session 1. Constraints and Optimization
Solving Partial Order Constraints for LPO Termination
Computationally Equivalent Elimination of Conditions
On the Correctness of Bubbling
Propositional Tree Automata
Session 2. Equational Reasoning
Generalizing Newman's Lemma for Left-Linear Rewrite Systems
Unions of Equational Monadic Theories
Modular Church-Rosser Modulo
Session 3. System Verification
Hierarchical Combination of Intruder Theories
Feasible Trace Reconstruction for Rewriting Approximations
Invited Talk
Javier Esparza Rewriting Models of Boolean Programs
Session 4. Lambda Calculus
Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear A-Calculus
A Terminating and Confluent Linear Lambda Calculus
A Lambda-Calculus with Constructors
Structural Proof Theory as Rewriting
Session 5. Theorem Proving
Checking Conservativity of Overloaded Definitions in Higher-Order Logic
Certified Higher-Order Recursive Path Ordering
Dealing with Non-orientable Equations in Rewriting Induction
Session 6. System Descriptions
TPA: Termination Proved Automatically
RAPT: A Program Transformation System Based on Term Rewriting
The CL-Atse Protocol Analyser
……
Invited Talk
Seesion 7. Termination
Seesion 8. Higher-Order Rewriting and Unification
Author Index
