000 -LEADER |
fixed length control field |
04838nam a22005655i 4500 |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
ISBN |
9783540685968 |
-- |
978-3-540-68596-8 |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
005.13 |
245 10 - TITLE STATEMENT |
Title |
Rewriting Techniques and Applications |
Sub Title |
7th International Conference, RTA-96 New Brunswick, NJ, USA, July 27–30, 1996 Proceedings / |
Statement of responsibility, etc |
edited by Harald Ganzinger. |
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
Place of publication |
Berlin, Heidelberg : |
Name of publisher |
Springer Berlin Heidelberg, |
Year of publication |
1996. |
300 ## - PHYSICAL DESCRIPTION |
Number of Pages |
XI, 440 p. |
Other physical details |
online resource. |
490 1# - SERIES STATEMENT |
Series statement |
Lecture Notes in Computer Science, |
505 0# - FORMATTED CONTENTS NOTE |
Formatted contents note |
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. |
520 ## - SUMMARY, ETC. |
Summary, etc |
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. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical Term |
Computer science. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical Term |
Logic design. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical Term |
Algebra |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical Term |
Artificial intelligence. |
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical Term |
Computer Science. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical Term |
Programming Languages, Compilers, Interpreters. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical Term |
Logics and Meanings of Programs. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical Term |
Mathematical Logic and Formal Languages. |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical Term |
Artificial Intelligence (incl. Robotics). |
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical Term |
Symbolic and Algebraic Manipulation. |
700 1# - ADDED ENTRY--PERSONAL NAME |
Personal name |
Ganzinger, Harald. |
856 40 - ELECTRONIC LOCATION AND ACCESS |
Uniform Resource Identifier |
http://dx.doi.org/10.1007/3-540-61464-8 |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Koha item type |
E-BOOKS |
264 #1 - |
-- |
Berlin, Heidelberg : |
-- |
Springer Berlin Heidelberg, |
-- |
1996. |
336 ## - |
-- |
text |
-- |
txt |
-- |
rdacontent |
337 ## - |
-- |
computer |
-- |
c |
-- |
rdamedia |
338 ## - |
-- |
online resource |
-- |
cr |
-- |
rdacarrier |
347 ## - |
-- |
text file |
-- |
PDF |
-- |
rda |
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE |
-- |
0302-9743 ; |