000 | 03134nam a22004575i 4500 | ||
---|---|---|---|
001 | 978-3-540-39679-6 | ||
003 | DE-He213 | ||
005 | 20160624101944.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1985 gw | s |||| 0|eng d | ||
020 |
_a9783540396796 _9978-3-540-39679-6 |
||
024 | 7 |
_a10.1007/3-540-15976-2 _2doi |
|
050 | 4 | _aQA8.9-QA10.3 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aMAT018000 _2bisacsh |
|
072 | 7 |
_aCOM051010 _2bisacsh |
|
082 | 0 | 4 |
_a005.131 _223 |
245 | 1 | 0 |
_aRewriting Techniques and Applications _h[electronic resource] : _bDijon, France, May 20–22, 1985 / _cedited by Jean-Pierre Jouannaud. |
246 | 3 | _aFirst International Conference on Rewriting Techniques and Applications | |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1985. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1985. |
|
300 |
_aVIII, 444 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v202 |
|
505 | 0 | _aBasic 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 | _aComputer science. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
700 | 1 |
_aJouannaud, Jean-Pierre. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540159766 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v202 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-15976-2 |
942 |
_2EBK4688 _cEBK |
||
999 |
_c33982 _d33982 |