|
|
|
|
| LEADER |
02419nmm a2200265 u 4500 |
| 001 |
EB000655305 |
| 003 |
EBX01000000000000001349122 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540396796
|
| 100 |
1 |
|
|a Jouannaud, Jean-Pierre
|e [editor]
|
| 245 |
0 |
0 |
|a Rewriting Techniques and Applications
|h Elektronische Ressource
|b Dijon, France, May 20-22, 1985
|c edited by Jean-Pierre Jouannaud
|
| 250 |
|
|
|a 1st ed. 1985
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1985, 1985
|
| 300 |
|
|
|a VIII, 444 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/3-540-15976-2
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-15976-2?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.131
|