<電子ブック>
Rewriting Techniques and Applications : 7th International Conference, RTA-96, New Brunswick, NJ, USA July 27 - 30, 1996. Proceedings / edited by Harald Ganzinger
(Lecture Notes in Computer Science. ISSN:16113349 ; 1103)
版 | 1st ed. 1996. |
---|---|
出版者 | (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer) |
出版年 | 1996 |
本文言語 | 英語 |
大きさ | XI, 440 p : online resource |
著者標目 | Ganzinger, Harald editor SpringerLink (Online service) |
件 名 | LCSH:Software engineering LCSH:Computer science LCSH:Compilers (Computer programs) LCSH:Machine theory LCSH:Artificial intelligence FREE:Software Engineering FREE:Theory of Computation FREE:Compilers and Interpreters FREE:Computer Science Logic and Foundations of Programming FREE:Formal Languages and Automata Theory FREE:Artificial Intelligence |
一般注記 | Rewrite-based automated reasoning: Challenges ahead -- Fine-grained concurrent completion -- AC-complete unification and its application to theorem proving -- Superposition theorem proving for abelian groups represented as integer modules -- Symideal Gröbner bases -- Termination of constructor systems -- Dummy elimination in equational rewriting -- On proving termination by innermost termination -- A recursive path ordering for higher-order terms in ?-long ?-normal form -- Higher-order superposition for dependent types -- Higher-order narrowing with definitional trees -- Design of a proof assistant -- A compiler for nondeterministic term rewriting systems -- Combinatory reduction systems with explicit substitution that preserve strong normalisation -- Confluence properties of extensional and non-extensional ?-calculi with explicit substitutions (extended abstract) -- On the power of simple diagrams -- Coherence for sharing proof nets -- Modularity of termination in term graph rewriting -- Confluence of terminating conditional rewrite systems revisited -- Applications of rewrite techniques in monoids and rings -- Compositional term rewriting: An algebraic proof of Toyama's theorem -- The first-order theory of one-step rewriting is undecidable -- An algorithm for distributive unification -- On the termination problem for one-rule semi-Thue system -- Efficient second-order matching -- Linear second-order unification -- Unification of higher-order patterns in a simply typed lambda-calculus with finite products and terminal type -- Decidable approximations of term rewriting systems -- Semantics and strong sequentially of priority term rewriting systems -- Higher-order families -- A new proof manager and graphic interface for the larch prover -- ReDuX 1.5: New facets of rewriting -- CiME: Completion modulo E -- Distributed larch prover (DLP): An experiment in parallelizing a rewrite-rule based prover -- EPIC: An equational language Abstract machine and supporting tools -- SPIKE-AC: A system for proofs by induction in Associative-Commutative theories -- On gaining efficiency in completion-based theorem proving This book constitutes the refereed proceedings of the 7th International Conference on Rewriting Techniques and Applications, RTA-96, held in New Brunswick, NJ, USA, in July 1996. The 27 revised full papers presented in this volume were selected from a total of 84 submissions, also included are six system descriptions and abstracts of three invited papers. The topics covered include analysis of term rewriting systems, string and graph rewriting, rewrite-based theorem proving, conditional term rewriting, higher-order rewriting, unification, symbolic and algebraic computation, and efficient implementation of rewriting on sequential and parallel machines HTTP:URL=https://doi.org/10.1007/3-540-61464-8 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9783540685968 |
|
電子リソース |
|
EB00225844 |