Rewriting Techniques and Applications (Record no. 36001)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 05173nam a22005655i 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783540492238 |
| -- | 978-3-540-49223-8 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.13 |
| 245 10 - TITLE STATEMENT | |
| Title | Rewriting Techniques and Applications |
| Sub Title | 6th International Conference, RTA-95 Kaiserslautern, Germany, April 5–7, 1995 Proceedings / |
| Statement of responsibility, etc | edited by Jieh Hsiang. |
| 260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | Berlin, Heidelberg : |
| Name of publisher | Springer Berlin Heidelberg, |
| Year of publication | 1995. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XII, 480 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 | On some mathematical logic contributions to rewriting techniques: Lost heritage -- Modularity of completeness revisited -- Automatic termination proofs with transformation orderings -- A termination ordering for higher order rewrite systems -- A complete characterization of termination of 0p 1q?1r 0s -- On narrowing, refutation proofs and constraints -- Completion for multiple reduction orderings -- Towards an efficient construction of test sets for deciding ground reducibility -- Term rewriting in contemporary resolution theorem proving -- ??!?=1 Optimizing optimal ?-calculus implementations -- Substitution tree indexing -- Concurrent garbage collection for concurrent rewriting -- Lazy rewriting and eager machinery -- A rewrite mechanism for logic programs with negation -- Level-confluence of conditional rewrite systems with extra variables in right-hand sides -- A polynomial algorithm testing partial confluence of basic semi-Thue systems -- Problems in rewriting applied to categorical concepts by the example of a computational comonad -- Relating two categorical models of term rewriting -- Towards a domain theory for termination proofs -- Higher-order rewrite systems -- Infinitary lambda calculi and böhm models -- Proving the genericity lemma by leftmost reduction is simple -- (Head-)normalization of typeable rewrite systems -- Explicit substitutions with de bruijn's levels -- A restricted form of higher-order rewriting applied to an HDL semantics -- Rewrite systems for integer arithmetic -- General solution of systems of linear diophantine equations and inequations -- Combination of constraint solving techniques: An algebraic point of view -- Some independence results for equational unification -- Regular substitution sets: A means of controlling E-unification -- DISCOUNT: A system for distributed equational deduction -- ASTRE: Towards a fully automated program transformation system -- Parallel ReDuX ? PaReDuX -- STORM: A many-to-one associative-commutative matcher -- LEMMA: A system for automated synthesis of recursive programs in equational theories -- Generating polynomial orderings for termination proofs -- Disguising recursively chained rewrite rules as equational theorems, as implemented in the prover EFTTP Mark 2 -- Prototyping completion with constraints using computational systems -- Guiding term reduction through a neural network: Some preliminary results for the group theory -- Studying quasigroup identities by rewriting techniques: Problems and first results -- Problems in rewriting III. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | This volume presents the proceedings of the Sixth International Conference on Rewriting Techniques and Applications, RTA-95, held in Kaiserslautern, Germany in April 1995. The 27 full revised papers were selected from a total of 87 submissions. In addition there are 9 system descriptions and two problem sets, one contributed by Mark E. Stickel and Hantao Zhang and another by Nachum Dershowitz, Jean-Pierre Jouannaud and Jan Willem Klop. The volume addresses all current aspects of rewriting techniques and their applications and thus defines the state-of-the-art in this active field of research. |
| 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 | Symbolic and Algebraic Manipulation. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Artificial Intelligence (incl. Robotics). |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Hsiang, Jieh. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/3-540-59200-8 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | E-BOOKS |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg, |
| -- | 1995. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 0302-9743 ; |
| Withdrawn status | Lost status | Damaged status | Not for loan | Current library | Accession Number | Uniform Resource Identifier | Koha item type |
|---|---|---|---|---|---|---|---|
| IMSc Library | EBK6707 | http://dx.doi.org/10.1007/3-540-59200-8 | E-BOOKS |