Danny De Schreye - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged term rewriting

Shallow confluence of conditional term rewriting systemsClaus-Peter Wirth. JSC, 44(1):60-98, 2009. [doi]

Deterministic bottom-up tree transducers and ground term rewrite systemsSándor Vágvölgyi. TCS, 410(21-23):2250-2278, 2009. [doi]

Term-Graph Rewriting Via Explicit PathsEmilie Balland, Pierre-Etienne Moreau. RTA 2008: 32-47 [doi]

Termination of Programs using Term Rewriting and SAT SolvingJürgen Giesl, Peter Schneider-Kamp, René Thiemann, Stephan Swiderski, Manh Thang Nguyen, Danny De Schreye, Alexander Serebrenik. Dagstuhl 2007: [doi]

Traces of Term-Automatic GraphsAntoine Meyer. mfcs 2007: 489-500 [doi]

Modeling Pointer Redirection as Cyclic Term-graph RewritingDominique Duval, Rachid Echahed, Frédéric Prost. ENTCS, 176(1):65-84, 2007. [doi]

An Account of Implementing Applicative Term RewritingMuck van Weerdenburg. ENTCS, 174(10):139-155, 2007. [doi]

Decidable call-by-need computations in term rewritingiandc, 196(2):95-126, 2005. [doi]

A Tool for Term Rewrite Systems and Tree AutomataIrène Durand. ENTCS, 124(2):29-49, 2005. [doi]

Böhm-Like Trees for Term Rewriting SystemsJeroen Ketema. RTA 2004: 233-248 [doi]

On Term Rewriting Systems Having a Rational DerivationAntoine Meyer. fossacs 2004: 378-392 [doi]

Reachability in Conditional Term Rewriting SystemsGuillaume Feuillade, Thomas Genet. ENTCS, 86(1):133-146, 2003. [doi]

Right-linear half-monadic term rewrite systemsSándor Vágvölgyi. TCS, 309(1-3):195-211, 2003. [doi]

Call-by-need reduction for membership conditional term rewriting SystemsMizuhito Ogawa. ENTCS, 86(4):673-688, 2003. [doi]

Term rewriting restricted to ground termsTCS, 302(1-3):135-165, 2003. [doi]

Timed Term Rewrite SystemsJeremie Blanc, Wendelin Serwe. ENTCS, 64:95-112, 2002. [doi]

Solution to the Problem of Zantema on a Persistent Property of Term Rewriting SystemsTakahito Aoto. jflp, 2001(11), 2001.

On interreduction of semi-complete term rewriting systemsBernhard Gramlich. TCS, 258(1-2):435-451, 2001. [doi]

Essentials of Term Graph RewritingDetlef Plump. ENTCS, 51:277-289, 2001. [doi]

Descendants and Origins in Term RewritingInge Bethke, Jan Willem Klop, Roel C. de Vrijer. iandc, 159(1-2):59-124, 2000.

Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation FactoriesWan Fokkink, Chris Verhoef. FASE 1999: 98-113

Term rewriting with operator evaluation strategiesSteven Eker. ENTCS, 15:311-330, 1998. [doi]

An Efficient Algorithm for Recognizing the Forward-Branching Class of Term-Rewriting SystemsAlain Miniussi, Robert Strandh. agp 1997: 445-456

Relating Confluence, Innermost-Confluence and Outermost-Confluence Properties of Term Rewriting SystemsM. R. K. Krishna Rao. ACTA, 33(6):595-606, 1996.

Minimal Term Rewriting SystemsJ. F. Th. Kamperman, H. R. Walters. compass 1996: 274-290

Abstraction of Conditional Term Rewriting SystemsDidier Bert, Rachid Echahed. SLP 1995: 162-176

T::L::P:::S::: - a Term Rewriting Laboratory (not only) for Experiments in Automatic Program SynthesisGunter Grieser. gosler 1995: 467-481

Modular Proofs for Completeness of Hierarchical Term Rewriting SystemsM. R. K. Krishna Rao. TCS, 151(2):487-512, 1995. [doi]

On the Adequacy of Graph Rewriting for Simulating Term RewritingRichard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries. TOPLAS, 16(3):493-523, 1994. [doi]

Simulation of SOS Definitions with Term Rewriting SystemsKarl-Heinz Buth. ESOP 1994: 150-164

On the Equivalence of Persistent Term Rewriting Systems and Recursive Program SchemesZurab Khasidashvili. istcs 1993: 240-249

Origin Functions in Lambda-Calculus and Term Rewriting SystemsYves Bertot. caap 1992: 49-65

Completeness and Confluence of Order-Sorted Term RewritingLars With. ctrs 1993: 393-407

Type Removal in Term RewritingHans Zantema. ctrs 1993: 148-154

Termination of Term Rewriting by InterpretationHans Zantema. ctrs 1993: 155-167

Order-Sorted Term RewritingA. J. J. Dick, Phil Watson. cj, 34(1):16-19, 1991.

Implementations of Term Rewriting SystemsMiki Hermann, Claude Kirchner, Hélène Kirchner. cj, 34(1):20-33, 1991.

Redex Capturing in Term Graph RewritingWilliam M. Farmer, Ronald J. Watro. ijfcs, 1(4):369-386, 1990.

Some Experiments Using Term Rewriting Techniques for ConcurrencyCarron Kirkwood, Kathy Norrie. forte 1991: 527-530

Extending EBG to Term-Rewriting SystemsPhilip D. Laird, Evan Gamble. AAAI 1990: 929-935

Applying Term Rewriting Methods to Finite GroupsReinhard Bündgen. icalp 1990: 332-346

COMTES - An Experimental Environment for the Completion of Term Rewriting SystemsJürgen Avenhaus, Klaus Madlener, Joachim Steinbach. RTA 1989: 542-546

Enumarating Outer Narrowing Derivations for Constructor-Based Term Rewriting SystemsJia-Huai You. JSC, 7(3/4):319-341, 1989.

Termination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt. RTA 1989: 477-491

Term Graph RewritingHendrik Pieter Barendregt, Marko C. J. D. van Eekelen, John R. W. Glauert, Richard Kennaway, Marinus J. Plasmeijer, M. Ronan Sleep. parle 1987: 141-158

Simplifying Conditional Term Rewriting Systems: Unification, Termination and ConfluenceStéphane Kaplan. JSC, 4(3):295-334, 1987.

A Refinement of Strong Sequentiality for Term Rewriting with Constructorsiandc, 72(1):46-65, January 1987.

A Compiler for a Class of Conditional Term Rewriting SystemsAlfons Geser, Heinrich Hußmann, Andreas Mück. ctrs 1988: 84-90

Concurrent term rewriting as a model of computationJoseph A. Goguen, Claude Kirchner, José Meseguer. gr 1987: 53-93

Fair Conditional Term Rewriting Systems: Unification, Termination, and ConfluenceStéphane Kaplan. adt 1985: 136-155

runs on WebDSL