Computationally equivalent elimination of conditionsSERBANUTA, Traian Florin; ROSU, Grigore.Lecture notes in computer science. 2006, pp 19-34, issn 0302-9743, isbn 3-540-36834-5, 1Vol, 16 p.Conference Paper

Parallel modular multiplication with table look-upCHE WUN CHIOU; YANG, T. C.International journal of computer mathematics. 1998, Vol 69, Num 1-2, pp 49-55, issn 0020-7160Article

Communication of Two Stacks and RewritingKARHUMÄKI, Juhani; KUNC, Michal; OKHOTIN, Alexander et al.Lecture notes in computer science. 2006, pp 468-479, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

A uniform framework for term and graph rewriting applied to combined systemsOHLEBUSCH, E.Information processing letters. 2000, Vol 73, Num 1-2, pp 53-59, issn 0020-0190Article

Modular properties of conditional term rewriting systemsMIDDELDORP, A.Information and computation (Print). 1993, Vol 104, Num 1, pp 110-158, issn 0890-5401Article

Knuth-Bendix procedure and non deterministic behavior- an example; Procédure de Knuth-Bendix et indéterminisme - un exempleGNAEDIG, I.Rapports de recherche - INRIA. 1987, Vol 733, issn 0249-6399, 10 p.Report

Logicality of conditional rewrite systemsYAMADA, T; AVENHAUS, J; LORIA-SAENZ, C et al.Theoretical computer science. 2000, Vol 236, Num 1-2, pp 209-232, issn 0304-3975Article

Preuves de terminaison des systèmes de réécriture associatifs commutatifs : une méthode fondée sur la réécriture elle-même = Termination proof for associative commutative rewriting systems: a method bared on the rewriting it-selfGNAEDIG, Isabelle.1986, 73 fThesis

RAPT : A program transformation system based on term rewritingCHIBA, Yuki; AOTO, Takahito.Lecture notes in computer science. 2006, pp 267-276, issn 0302-9743, isbn 3-540-36834-5, 1Vol, 10 p.Conference Paper

Dependency pairs for simply typed term rewritingAOTO, Takahito; YAMADA, Toshiyuki.Lecture notes in computer science. 2005, pp 120-134, issn 0302-9743, isbn 3-540-25596-6, 15 p.Conference Paper

A type-based termination criterion for dependently-typed higher-order rewrite systemsBLANQUI, Frédéric.Lecture notes in computer science. 2004, pp 24-39, issn 0302-9743, isbn 3-540-22153-0, 16 p.Conference Paper

Expressing combinatory reduction systems derivations in the rewriting calculusBERTOLISSI, Clara; CIRSTEA, Horatiu; KIRCHNER, Claude et al.Higher-order and symbolic computation. 2006, Vol 19, Num 4, pp 345-376, issn 1388-3690, 32 p.Article

Infinitary normalizationKLOP, Jan Willem; DE VRIJER, Roel.Report - Software engineering. 2005, Num 16, pp 1-24, issn 1386-369X, 24 p.Article

The undecidability of the unification and matching problem for canonical theoriesHEILBRUNNER, S; HÖLLDOBLER, S.Acta informatica. 1987, Vol 24, Num 2, pp 157-171, issn 0001-5903Article

Predictive labelingHIROKAWA, Nao; MIDDELDORP, Aart.Lecture notes in computer science. 2006, pp 313-327, issn 0302-9743, isbn 3-540-36834-5, 1Vol, 15 p.Conference Paper

Partial inversion of constructor term rewriting systemsNISHIDA, Naoki; SAKAI, Masahiko; SAKABE, Toshiki et al.Lecture notes in computer science. 2005, pp 264-278, issn 0302-9743, isbn 3-540-25596-6, 15 p.Conference Paper

Adding algebraic rewriting to the untyped lambda calculus = Ajout de la réécriture algébrique au lambda calcul non typéDOUGHERTY, D. J.Information and computation (Print). 1992, Vol 101, Num 2, pp 251-267, issn 0890-5401Article

Reachability analysis of fragments of mobi ambients in AC term rewritingDELZANNO, Giorgio; MONTAGNA, Roberto.Formal aspects of computing. 2008, Vol 20, Num 4-5, pp 407-428, issn 0934-5043, 22 p.Article

Derivation trees of ground term rewriting systemsENGELFRIET, J.Information and computation (Print). 1999, Vol 152, Num 1, pp 1-15, issn 0890-5401Article

Termination of term rewriting using dependency pairsARTS, T; GIESL, J.Theoretical computer science. 2000, Vol 236, Num 1-2, pp 133-178, issn 0304-3975Article

Uncurrying for Termination and ComplexityHIROKAWA, Nao; MIDDELDORP, Aart; ZANKL, Harald et al.Journal of automated reasoning. 2013, Vol 50, Num 3, pp 279-315, issn 0168-7433, 37 p.Article

Termination and derivational complexity of confluent one-rule string-rewriting systemsKOBAYASHI, Yuji; KATSURA, Masashi; SHIKISHIMA-TSUJI, Kayoko et al.Theoretical computer science. 2001, Vol 262, Num 1-2, pp 583-632, issn 0304-3975Article

Process rewrite systemsMAYR, R.Information and computation (Print). 2000, Vol 156, Num 1-2, pp 264-286, issn 0890-5401Article

Computational power of two stacks with restricted communicationKARHUMÄKI, Juhani; KUNC, Michal; OKHOTIN, Alexander et al.Information and computation (Print). 2010, Vol 208, Num 9, pp 1060-1089, issn 0890-5401, 30 p.Article

RTA 2003 : rewriting techniques and applications (Valencia, 9-11 June 2003)Nieuwenhuis, Robert.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40254-3, XI, 514 p, isbn 3-540-40254-3Conference Proceedings