X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Rewriting techniques and applications : Dijon, France, May 20 - 22, 1985 (1985)
    Berlin u.a. : Springer
    Details
    UID:
    b3kat_BV035987800
    Format: 1 Online-Ressource (VI, 440 S.)
    ISBN: 3540159762 , 0387159762
    Series Statement: Lecture notes in computer science 202
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Reduktionssystem ; Datenverarbeitung ; Produktion ; Termersetzungssystem ; Konferenzschrift
    DOI: 10.1007/3-540-15976-2
    URL: Volltext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    EUV Frankfurt
    HTW Berlin
    TH Wildau
    BTU Cottbus
  • 2
    Online Resource
    Online Resource
    Rewriting techniques and applications : Dijon, France, May 20 - 22, 1985 (1985)
    Berlin [u.a.] : Springer
    Details
    UID:
    gbv_595131190
    Format: Online-Ressource (VI, 440 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540396796
    Series Statement: Lecture notes in computer science 202
    Content: 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.
    Note: Literaturangaben
    Additional Edition: ISBN 3540159762
    Additional Edition: ISBN 0387159762
    Additional Edition: ISBN 9783540159766
    Additional Edition: Erscheint auch als Druck-Ausgabe Rewriting techniques and applications Berlin [u.a.] : Springer, 1985 ISBN 3540159762
    Additional Edition: ISBN 0387159762
    Language: English
    Keywords: Konferenzschrift
    DOI: 10.1007/3-540-15976-2
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: lizenzpflichtig
    URL: Volltext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    Stabi Berlin
    UB Potsdam
  • 3
    Book
    Book
    Rewriting techniques and applications : Dijon, France, May 20 - 22, 1985 ; [First International Conference on Rewriting Techniques and Applications] (1985)
    Berlin [u.a.] :Springer,
    Details
    UID:
    almahu_BV000391664
    Format: VI, 440 S.
    ISBN: 3-540-15976-2 , 0-387-15976-2
    Series Statement: Lecture notes in computer science 202
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Reduktionssystem ; Datenverarbeitung ; Produktion ; Termersetzungssystem ; Konferenzschrift ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    HU Berlin get availability status
    FU Berlin get availability status
  • 4
    Online Resource
    Online Resource
    Rewriting Techniques and Applications : Dijon, France, May 20-22, 1985 (1985)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almafu_9959186097102883
    Format: 1 online resource (VIII, 444 p.)
    Edition: 1st ed. 1985.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-39679-9
    Series Statement: Lecture Notes in Computer Science, 202
    Note: Bibliographic Level Mode of Issuance: Monograph , 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. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-15976-2
    Language: English
    DOI: 10.1007/3-540-15976-2
    URL: http://dx.doi.org/10.1007/3-540-15976-2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    FU Berlin
    Charité
  • 5
    Online Resource
    Online Resource
    Rewriting Techniques and Applications : Dijon, France, May 20–22, 1985 (1985)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Details
    UID:
    almahu_9947920876302882
    Format: VIII, 444 p. , online resource.
    ISBN: 9783540396796
    Series Statement: Lecture Notes in Computer Science, 202
    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.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540159766
    Language: English
    DOI: 10.1007/3-540-15976-2
    URL: http://dx.doi.org/10.1007/3-540-15976-2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 6
    Online Resource
    Online Resource
    Rewriting Techniques and Applications : Dijon, France, May 20-22, 1985 (1985)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almahu_9948621703902882
    Format: VIII, 444 p. , online resource.
    Edition: 1st ed. 1985.
    ISBN: 9783540396796
    Series Statement: Lecture Notes in Computer Science, 202
    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.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662176191
    Additional Edition: Printed edition: ISBN 9783540159766
    Language: English
    DOI: 10.1007/3-540-15976-2
    URL: https://doi.org/10.1007/3-540-15976-2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 7
    Book
    Book
    Rewriting techniques and applications : Dijon, France, May 20 - 22, 1985 ; [First International Conference on Rewriting Techniques and Applications] (1985)
    Berlin [u.a.] : Springer
    Details
    UID:
    b3kat_BV000391664
    Format: VI, 440 S.
    ISBN: 3540159762 , 0387159762
    Series Statement: Lecture notes in computer science 202
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Reduktionssystem ; Datenverarbeitung ; Produktion ; Termersetzungssystem ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    TU Berlin get availability status
  • 8
    Online Resource
    Online Resource
    Rewriting Techniques and Applications : Dijon, France, May 20-22, 1985 (1985)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    edoccha_9959186097102883
    Format: 1 online resource (VIII, 444 p.)
    Edition: 1st ed. 1985.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-39679-9
    Series Statement: Lecture Notes in Computer Science, 202
    Note: Bibliographic Level Mode of Issuance: Monograph , 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. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-15976-2
    Language: English
    DOI: 10.1007/3-540-15976-2
    URL: http://dx.doi.org/10.1007/3-540-15976-2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Charité
  • 9
    Online Resource
    Online Resource
    Rewriting Techniques and Applications : Dijon, France, May 20-22, 1985 (1985)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    edocfu_9959186097102883
    Format: 1 online resource (VIII, 444 p.)
    Edition: 1st ed. 1985.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-39679-9
    Series Statement: Lecture Notes in Computer Science, 202
    Note: Bibliographic Level Mode of Issuance: Monograph , 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. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-15976-2
    Language: English
    DOI: 10.1007/3-540-15976-2
    URL: http://dx.doi.org/10.1007/3-540-15976-2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    FU Berlin
  • 10
    Book
    Book
    Rewriting techniques and applications : RTA ; 1. international conference, Dijon, France, May 20 - 22, 1985 ; proceedings (1985)
    Berlin [u.a.] : Springer
    Details
    UID:
    gbv_02350238X
    Format: VI, 440 S. , graph. Darst.
    ISBN: 3540159762 , 0387159762
    Series Statement: Lecture notes in computer science 202
    Note: Literaturangaben
    Additional Edition: Online-Ausg. Rewriting techniques and applications Berlin [u.a.] : Springer, 1985 ISBN 9783540396796
    Language: English
    Keywords: Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    Stabi Berlin get availability status
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Did you mean 9783540119760?
Did you mean 9783540133766?
Did you mean 9783540059769?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages