Rewriting Techniques and Applications : 5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993. Proceedings. 1st ed. 1993

種類:

電子ブック

責任表示:

edited by Claude Kirchner

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1993

著者名:

• Kirchner, Claude.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 690

ISBN:

9783662215517 [3662215519]    

注記:

Rewrite techniques in theorem proving -- Redundancy criteria for constrained completion -- Bi-rewriting, a term rewriting technique for monotonic order relations -- A case study of completion modulo distributivity and Abelian groups -- A semantic approach to order-sorted rewriting -- Distributing equational theorem proving -- On the correctness of a distributed memory Gröbner basis algorithm -- Improving transformation systems for general E-unification -- Equational and membership constraints for infinite trees -- Regular path expressions in feature logic -- Proving properties of typed lambda terms: Realizability, covers, and sheaves -- Some lambda calculi with categorical sums and products -- Paths, computations and labels in the ?-calculus -- Confluence and superdevelopments -- Relating graph and term rewriting via Böhm models -- Topics in termination -- Total termination of term rewriting -- Simple termination is difficult -- Optimal normalization in orthogonal term rewriting systems -- A graph reduction a
This volume contains the proceedings of RTA-93, the fifth International Conference on Rewriting Techniques and Applications, held in Montreal, Canada, in June 1993. The volume includes three invited lectures, "Rewrite techniques in theorem proving" (L. Bachmair), "Proving properties of typed lambda terms: realizability, covers, and sheaves" (J. Gallier), and "On some algorithmic problems for groups and monoids" (S.J. Adian), together with 29 selected papers, 6 system descriptions, and a list of open problems in the field. The papers covermany topics: term rewriting; termination; graph rewriting; constraint solving; semantic unification, disunification and combination; higher-order logics; and theorem proving, with several papers on distributed theorem proving, theorem proving with constraints and completion.

ローカル注記:

学内専用E-BOOKS (local access only)