Rewriting Techniques and Applications (Record no. 33982)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03134nam a22004575i 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783540396796 |
| -- | 978-3-540-39679-6 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.131 |
| 245 10 - TITLE STATEMENT | |
| Title | Rewriting Techniques and Applications |
| Sub Title | Dijon, France, May 20–22, 1985 / |
| Statement of responsibility, etc | edited by Jean-Pierre Jouannaud. |
| 246 3# - VARYING FORM OF TITLE | |
| Title proper/short title | First International Conference on Rewriting Techniques and Applications |
| 260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | Berlin, Heidelberg : |
| Name of publisher | Springer Berlin Heidelberg, |
| Year of publication | 1985. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | VIII, 444 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 | Basic features and development of the critical-pair/completion procedure -- Contextual rewriting -- Thue systems as rewriting systems -- Deciding algebraic properties of monoids presented by finite church-rosser Thue systems -- Two applications of equational theories to database theory -- An experiment in partial evaluation: The generation of a compiler generator -- NARROWER: a new algorithm for unification and its application to Logic Programming -- Solving type equations by graph rewriting -- Termination -- Path of subterms ordering and recursive decomposition ordering revisited -- Associative path orderings -- A procedure for automatically proving the termination of a set of rewrite rules -- Petrireve: Proving Petri net properties with rewriting systems -- Fairness in term rewriting systems -- Two results in term rewriting theorem proving -- Handling function definitions through innermost superposition and rewriting -- An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras -- Combining unification algorithms for confined regular equational theories -- An algebraic approach to unification under associativity and commutativity -- Unification problems with one-sided distributivity -- Fast many-to-one matching algorithms -- Complexity of matching problems -- The set of unifiers in typed ?-calculus as regular expression -- Equational systems for category theory and intuitionistic logic. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computer science. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Mathematical Logic and Formal Languages. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Jouannaud, Jean-Pierre. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/3-540-15976-2 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | E-BOOKS |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg, |
| -- | 1985. |
| 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 | EBK4688 | http://dx.doi.org/10.1007/3-540-15976-2 | E-BOOKS |