skip to main content
Idioma:
Primo Search
Clear Search Box
Search in: Busca Geral
Busca Avançada
Busca por Índices

Rewriting techniques and applications 9th international conference, RTA-98, Tsukuba, Japan, March 28-April 1, 1998 : proceedings

Tobias Nipkow 1958-; International Conference on Rewriting Techniques and Applications (9th 1998 Tsukuba-shi, Japan)

Berlin Springer New York 1998

Localização: ICMC - Inst. Ciên. Mat. Computação    (68-02 LNCS v.1379 ) e outros locais(Acessar)

  • Título:
    Rewriting techniques and applications 9th international conference, RTA-98, Tsukuba, Japan, March 28-April 1, 1998 : proceedings
  • Autor: Tobias Nipkow 1958-; International Conference on Rewriting Techniques and Applications (9th 1998 Tsukuba-shi, Japan)
  • Assuntos: Rewriting systems (Computer science) -- Congresses; Computer programming -- Congresses; Algorithms -- Congresses; LINGUAGENS FORMAIS (CONGRESSOS); TEORIA DA COMPUTAÇÃO
  • Notas: Includes bibliographical references and index
  • Descrição: Origin tracking in term rewriting / Jan Willem Klop -- Simultaneous critical pairs and Church-Rosser property / Satoshi Okui -- Church-Rosser theorems for abstract reduction modulo an equivalence relation / Enno Ohlebusch -- Automatic monoidsversus monoids with finite convergent presentations / Friedrich Otto, Andrea Sattler-Klein, Klaus Madlener -- Decidable and undecidable second-order unification problems / Jordi Levy -- On the exponent of periodicity of minimal solutions ofcontext equations / Manfred Schmidt-Schaugbs, Klaus U. Schulz -- Unification in extensions of shallow equational theories / Florent Jacquemard, Christoph Meyer, Christoph Weidenbach -- Unificationand matching in process algebras / Qing Guo,Paliath Narendran, Sandeep K. Shukla -- E-unification for subsystems of S4 / Renate A. Schmidt -- Solving disequations modulo some class of rewrite systems / Sébastien Limet, Pierre Réty -- About proofs by consistency / Hubert Comon --Normalization of S-terms is decidable / Johannes Waldmann -- Decidable approximations of sets of descendants and sets of normal forms / Thomas Genet -- Algorithms and reductions for rewriting problems / Rakesh M. Verma, Michael Rusinowitsch,Denis Lugiez -- The decidability of simultaneous rigid e-unification with one variable / Anatoli Degtyarev ... [et al.] -- Ordering constraints over feature trees expressed in second-order monadic logic / Martin Müller, Joachim Niehren --Co-definite set
    constraints / Witold Charatonik, Andreas Podelski -- Modularity of termination using dependency pairs / Thomas Arts, Jürgen Giesl -- Termination of associative-commutative rewriting by dependency pairs / Claude Marché, XavierUrbain -- Termination transformation by tree lifting ordering / Takahito Aoto, Yoshihito Toyama -- Towards automated termination proofsthrough "freezing" / Hongwei Xi -- Higher-order rewriting and partial evaluation / Olivier Danvy, KristofferHøgsbro Rose -- SN combinators and partial combinatory a
  • Títulos relacionados: Série:Lecture notes in computer science 1379
  • Editor: Berlin Springer New York
  • Data de criação/publicação: 1998
  • Formato: x, 342 p. 24 cm.
  • Idioma: Inglês
Links
Voltar para lista de resultados

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.