Steven Eker - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged term rewriting

The Second Rewrite Engines CompetitionFrancisco Durán, Manuel Roldán, Emilie Balland, Mark G. J. van den Brand, Steven Eker, Karl Trygve Kalleberg, Lennart C. L. Kats, Pierre-Etienne Moreau, Ruslan Shevchenko, Eelco Visser. ENTCS, 238(3):281-291, 2009. [doi]

Shallow confluence of conditional term rewriting systemsClaus-Peter Wirth. JSC, 44(1):60-98, 2009. [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]

Book review: Advanced Topics in Term Rewriting by Enno Ohlebusch, Springer-Verlag, 2002, hard cover: ISBN 0-387-95250-0Femke van Raamsdonk. tplp, 4(4):539-541, 2004.

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

Reachability and confluence are undecidable for flat term rewriting systemsFlorent Jacquemard. ipl, 87(5):265-270, 2003. [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]

Intelligent Network Control Using Object-Oriented Term-RewritingAdam Steele. caine 2001: 29-32

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

Deriving Theory Superposition Calculi from Convergent Term Rewriting SystemsJürgen Stuber. RTA 2000: 229-245

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.

Lambda-Definable Term rewriting SystemsSugwoo Byun, Richard Kennaway, M. Ronan Sleep. asian 1996: 106-115

A Master-Slave Approach to Parallel Term Rewriting on a Hierarchical MultiprocessorReinhard Bündgen, Manfred Göbel, Wolfgang Küchlin. disco 1996: 183-194

A Compiler for Nondeterministic Term Rewriting SystemsMarian Vittek. RTA 1996: 154-167

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

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]

A Complete Proof System for Nested Term GraphsStefan Blom. hoa 1996: 74-89

Confluence of Curried Term-Rewriting SystemsStefan Kahrs. JSC, 19(6):601-623, 1995.

Graph Reducibility of Term Rewriting SystemsM. R. K. Krishna Rao. mfcs 1995: 371-381

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

Simple Termination of Hierarchical Combinations of Term Rewriting SystemsM. R. K. Krishna Rao. tacs 1994: 203-223

Flatterms, Discrimination Nets, and Fast Term RewritingJim Christian. JAR, 10(1):95-113, 1993.

Completeness of Hierarchical Combinations of term Rewriting SystemsM. R. K. Krishna Rao. fsttcs 1993: 125-138

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

Using SOS Definitions in Term Rewriting ProofsKarl-Heinz Buth. larch 1993: 36-54

Code Selection by Regularly Controlled Term RewritingHelmut Emmelmann. Dagstuhl 1991: 3-29

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

Extended Term Rewriting SystemsJan Willem Klop, Roel C. de Vrijer. ctrs 1991: 26-50

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

A Self-Applicable Partial Evaluator for Term Rewriting SystemsAnders Bondorf. tapsoft 1989: 81-95

Proving Inductive Theorems Based on Term Rewriting SystemsDieter Hofbauer, Ralf-Detlef Kutsche. icalp 1988: 180-190

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

A note on termination in combinatiosn of heterogeneous term rewriting systemsHarald Ganzinger, Robert Giegerich. eatcs, 31:22-27, 1987.

Experiences with the RAP System - A Specification Interpreter Combining Term Rewriting and ResolutionAlfons Geser, Heinrich Hußmann. ESOP 1986: 339-350

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

Unique Normal Forms in Term Rewriting Systems with Repeated VariablesPaul Chew. stoc 1981: 7-18

runs on WebDSL