Hans Zantema - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged term rewriting

Degrees of Undecidability in Term RewritingJÃ¶rg Endrullis, Herman Geuvers, Hans Zantema. csl 2009: 255-270 [doi]

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

Matrix Interpretations for Proving Termination of Term RewritingJörg Endrullis, Johannes Waldmann, Hans Zantema. JAR, 40(2-3):195-220, 2008. [doi]

Certification of Proving Termination of Term Rewriting by Matrix InterpretationsAdam Koprowski, Hans Zantema. sofsem 2008: 328-339 [doi]

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

On tree automata that certify termination of left-linear term rewriting systemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. iandc, 205(4):512-534, 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]

Matrix Interpretations for Proving Termination of Term RewritingJörg Endrullis, Johannes Waldmann, Hans Zantema. cade 2006: 574-588 [doi]

On Tree Automata that Certify Termination of Left-Linear Term Rewriting SystemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. RTA 2005: 353-367 [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]

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]

Relative Undecidability in Term Rewriting: I. The Termination HierarchyAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. iandc, 178(1):101-131, 2002. [doi]

Relative Undecidability in Term Rewriting: II. The Confluence HierarchyAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. iandc, 178(1):132-148, 2002. [doi]

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

The Termination Hierarchy for Term RewritingHans Zantema. aaecc, 12(1/2):3-19, 2001. [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]

Total Termination of Term RewritingMaria C. F. Ferreira, Hans Zantema. aaecc, 7(2):133-162, 1996. [doi]

Relative Undecidability in Term RewritingAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. csl 1997: 150-166

Termination of Term Rewriting by Semantic LabellingHans Zantema. FUIN, 24(1/2):89-105, 1995.

Total Termination of Term Rewriting is UndecidableHans Zantema. JSC, 20(1):43-60, 1995.

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

Termination of Term Rewriting: Interpretation and Type EliminationHans Zantema. JSC, 17(1):23-50, 1994.

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

Total Termination of Term RewritingMaria C. F. Ferreira, Hans Zantema. RTA 1993: 213-227

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

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

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

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

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

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.

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.

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

runs on WebDSL