×

zbMATH — the first resource for mathematics

Middeldorp, Aart

Compute Distance To:
Author ID: middeldorp.aart Recent zbMATH articles by "Middeldorp, Aart"
Published as: Middeldorp, A.; Middeldorp, Aart
External Links: MGP
Documents Indexed: 119 Publications since 1988, including 7 Books

Publications by Year

Citations contained in zbMATH Open

87 Publications have been cited 502 times in 247 Documents Cited by Year
Tyrolean termination tool: techniques and features. Zbl 1111.68048
Hirokawa, Nao; Middeldorp, Aart
25
2007
Automating the dependency pair method. Zbl 1081.68038
Hirokawa, Nao; Middeldorp, Aart
24
2005
Completeness results for basic narrowing. Zbl 0810.68088
Middeldorp, Aart; Hamoen, Erik
24
1994
Modular properties of conditional term rewriting systems. Zbl 0804.68071
Middeldorp, Aart
24
1993
SAT solving for termination analysis with polynomial interpretations. Zbl 1214.68352
Fuhs, Carsten; Giesl, Jürgen; Middeldorp, Aart; Schneider-Kamp, Peter; Thiemann, René; Zankl, Harald
22
2007
Dependency pairs revisited. Zbl 1187.68275
Hirokawa, Nao; Middeldorp, Aart
18
2004
Transformation techniques for context-sensitive rewrite systems. Zbl 1104.68056
Giesl, Jürgen; Middeldorp, Aart
17
2004
Sequentiality in orthogonal term rewriting systems. Zbl 0746.68047
Klop, Jan Willem; Middeldorp, Aart
16
1991
Completeness of combinations of constructor systems. Zbl 0778.68050
Middeldorp, Aart; Toyama, Yoshihito
15
1993
Approximating dependency graphs using tree automata techniques. Zbl 0988.68162
Middeldorp, Aart
14
2001
A sufficient condition for the termination of the direct sum of term rewriting systems. Zbl 0716.68054
Middeldorp, Aart
14
1989
Tyrolean termination tool. Zbl 1078.68656
Hirokawa, Nao; Middeldorp, Aart
12
2005
Satisfiability of non-linear (ir)rational arithmetic. Zbl 1310.68126
Zankl, Harald; Middeldorp, Aart
11
2010
CSI – a confluence tool. Zbl 1341.68199
Zankl, Harald; Felgenhauer, Bertram; Middeldorp, Aart
10
2011
Lazy narrowing: Strong completeness and eager variable elimination. Zbl 0874.68157
Middeldorp, Aart; Okui, Satoshi; Ida, Tetsuo
10
1996
Simple termination is difficult. Zbl 0815.68064
Middeldorp, Aart; Gramlich, Bernhard
10
1995
Polynomial interpretations with negative coefficients. Zbl 1109.68501
Hirokawa, Nao; Middeldorp, Aart
9
2004
Maximal termination. Zbl 1145.68446
Fuhs, Carsten; Giesl, Jürgen; Middeldorp, Aart; Schneider-Kamp, Peter; Thiemann, René; Zankl, Harald
8
2008
Decidable call-by-need computations in term rewriting. Zbl 1101.68628
Durand, Iréne; Middeldorp, Aart
8
2005
Approximations for strategies and termination. Zbl 1270.68132
Middeldorp, Aart
8
2002
Modularity of confluence: A simplified proof. Zbl 0795.68111
Klop, Jan Willem; Middeldorp, Aart; Toyama, Yoshihito; de Vrijer, Roel
8
1994
Decreasing diagrams and relative termination. Zbl 1243.68199
Hirokawa, Nao; Middeldorp, Aart
7
2011
KBO orientability. Zbl 1184.68303
Zankl, Harald; Hirokawa, Nao; Middeldorp, Aart
7
2009
Uncurrying for termination. Zbl 1182.68094
Hirokawa, Nao; Middeldorp, Aart; Zankl, Harald
7
2008
Strongly sequential and inductively sequential term rewriting systems. Zbl 1339.68136
Hanus, Michael; Lucas, Salvador; Middeldorp, Aart
7
1998
Simple termination of rewrite systems. Zbl 0903.68106
Middeldorp, Aart; Zantema, Hans
7
1997
Transforming termination by self-labelling. Zbl 0939.68684
Ferreira, Maria C. F.; Middeldorp, Aart; Ohsaki, Hitoshi; Zantema, Hans
7
1995
Relative undecidability in term rewriting. II: The confluence hierarchy. Zbl 1012.68097
Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans
6
2002
A deterministic lazy narrowing calculus. Zbl 0983.68090
Middeldorp, Aart; Okui, Satoshi
6
1998
Conditional confluence (system description). Zbl 1416.68181
Sternagel, Thomas; Middeldorp, Aart
5
2014
Labelings for decreasing diagrams. Zbl 1236.68157
Zankl, Harald; Felgenhauer, Bertram; Middeldorp, Aart
5
2011
Joint spectral radius theory for automated complexity analysis of rewrite systems. Zbl 1307.68042
Middeldorp, Aart; Moser, Georg; Neurauter, Friedrich; Waldmann, Johannes; Zankl, Harald
5
2011
Automating the dependency pair method. Zbl 1278.68264
Hirokawa, Nao; Middeldorp, Aart
5
2003
Innermost termination of context-sensitive rewriting. Zbl 1015.68106
Giesl, Jürgen; Middeldorp, Aart
5
2003
Relative undecidability in term rewriting. I: The termination hierarchy. Zbl 1012.68096
Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans
5
2002
A sequential reduction strategy. Zbl 0872.68080
Antoy, Sergio; Middeldorp, Aart
5
1996
Level-confluence of conditional rewrite systems with extra variables in right-hand sides. Zbl 0939.68679
Suzuki, Taro; Middeldorp, Aart; Ida, Tetsuo
5
1995
Uncurrying for termination and complexity. Zbl 1286.68262
Hirokawa, Nao; Middeldorp, Aart; Zankl, Harald
4
2013
Revisiting matrix interpretations for polynomial derivational complexity of term rewriting. Zbl 1306.68083
Neurauter, Friedrich; Zankl, Harald; Middeldorp, Aart
4
2010
Predictive labeling with dependency pairs using SAT. Zbl 1213.68349
Koprowski, Adam; Middeldorp, Aart
4
2007
Proving termination of rewrite systems using bounds. Zbl 1203.68077
Korp, Martin; Middeldorp, Aart
4
2007
Logicality of conditional rewrite systems. Zbl 0938.68050
Yamada, T.; Avenhaus, J.; Loría-Sáenz, C.; Middeldorp, A.
4
2000
Automating the first-order theory of rewriting for left-linear right-ground rewrite systems. Zbl 1387.68149
Rapp, Franziska; Middeldorp, Aart
3
2016
Layer systems for proving confluence. Zbl 1246.68136
Felgenhauer, Bertram; Zankl, Harald; Middeldorp, Aart
3
2011
Optimizing \(\text{mkb}_{\text{TT}}\). Zbl 1236.68156
Winkler, Sarah; Sato, Haruhiko; Middeldorp, Aart; Kurihara, Masahito
3
2010
Termination tools in ordered completion. Zbl 1291.68376
Winkler, Sarah; Middeldorp, Aart
3
2010
Match-bounds revisited. Zbl 1192.68399
Korp, Martin; Middeldorp, Aart
3
2009
Constraints for argument filterings. Zbl 1131.68468
Zankl, Harald; Hirokawa, Nao; Middeldorp, Aart
3
2007
Satisfying KBO constraints. Zbl 1203.68080
Zankl, Harald; Middeldorp, Aart
3
2007
Predictive labeling. Zbl 1151.68446
Hirokawa, Nao; Middeldorp, Aart
3
2006
Processes, terms and cycles: steps on the road to infinity. Essays dedicated to Jan Willem Klop on the occasion of his 60th birthday. Zbl 1097.68007
Middeldorp, Aart (ed.); van Oostrom, Vincent (ed.); van Raamsdonk, Femke (ed.); de Vrijer, Roel (ed.)
3
2005
Tsukuba termination tool. Zbl 1038.68561
Hirokawa, Nao; Middeldorp, Aart
3
2003
Relative undecidability in term rewriting. Zbl 0884.68067
Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans
3
1997
CSI: new evidence - a progress report. Zbl 06778416
Nagele, Julian; Felgenhauer, Bertram; Middeldorp, Aart
2
2017
Certification of classical confluence results for left-linear term rewrite systems. Zbl 06644750
Nagele, Julian; Middeldorp, Aart
2
2016
Improving automatic confluence analysis of rewrite systems by redundant rules. Zbl 1366.68125
Nagele, Julian; Felgenhauer, Bertram; Middeldorp, Aart
2
2015
Beyond polynomials and Peano arithmetic – automation of elementary and ordinal interpretations. Zbl 1315.68168
Zankl, Harald; Winkler, Sarah; Middeldorp, Aart
2
2015
Revisiting matrix interpretations for proving termination of term rewriting. Zbl 1236.68141
Neurauter, Friedrich; Middeldorp, Aart
2
2011
Increasing interpretations. Zbl 1166.68381
Zankl, Harald; Middeldorp, Aart
2
2008
Multi-completion with termination tools. (System description). Zbl 1165.68472
Sato, Haruhiko; Winkler, Sarah; Kurihara, Masahito; Middeldorp, Aart
2
2008
Match-bounds with dependency pairs for proving termination of rewrite systems. Zbl 1156.68430
Korp, Martin; Middeldorp, Aart
2
2008
Root-labeling. Zbl 1145.68453
Sternagel, Christian; Middeldorp, Aart
2
2008
On the modularity of deciding call-by-need. Zbl 0978.68071
Durand, Irène; Middeldorp, Aart
2
2001
Equational termination by semantic labelling. Zbl 0973.68094
Ohsaki, Hitoshi; Middeldorp, Aart; Giesl, Jürgen
2
2000
Type introduction for equational rewriting. Zbl 0957.68050
Middeldorp, Aart; Ohsaki, Hitoshi
2
2000
Transforming termination by self-labelling. Zbl 1412.68112
Middeldorp, Aart; Ohsaki, Hitoshi; Zantema, Hans
2
1996
Completeness of combinations of conditional constructor systems. Zbl 0942.68592
Middeldorp, Aart
2
1994
Infinite runs in abstract completion. Zbl 1441.68113
Hirokawa, Nao; Middeldorp, Aart; Sternagel, Christian; Winkler, Sarah
1
2017
Complexity of conditional term rewriting. Zbl 1398.68275
Kop, Cynthia; Middeldorp, Aart; Sternagel, Thomas
1
2017
AC-KBO revisited. Zbl 1379.68277
Yamada, Akihisa; Winkler, Sarah; Hirokawa, Nao; Middeldorp, Aart
1
2016
Conditional complexity. Zbl 1366.68121
Kop, Cynthia; Middeldorp, Aart; Sternagel, Thomas
1
2015
A new and formalized proof of abstract completion. Zbl 1416.68164
Hirokawa, Nao; Middeldorp, Aart; Sternagel, Christian
1
2014
Multi-completion with termination tools. Zbl 1362.68253
Winkler, Sarah; Sato, Haruhiko; Middeldorp, Aart; Kurihara, Masahito
1
2013
Ordinals and Knuth-Bendix orders. Zbl 1352.03018
Winkler, Sarah; Zankl, Harald; Middeldorp, Aart
1
2012
Beyond Peano arithmetic – automatically proving termination of the Goodstein sequence. Zbl 1356.68206
Winkler, Sarah; Zankl, Harald; Middeldorp, Aart
1
2011
AC completion with termination tools. Zbl 1341.68198
Winkler, Sarah; Middeldorp, Aart
1
2011
Polynomial interpretations over the reals do not subsume polynomial interpretations over the integers. Zbl 1236.68142
Neurauter, Friedrich; Middeldorp, Aart
1
2010
Decreasing diagrams and relative termination. Zbl 1291.68347
Hirokawa, Nao; Middeldorp, Aart
1
2010
Finding and certifying loops. Zbl 1274.68153
Zankl, Harald; Sternagel, Christian; Hofbauer, Dieter; Middeldorp, Aart
1
2010
Transforming SAT into termination of rewriting. Zbl 1347.68202
Zankl, Harald; Sternagel, Christian; Middeldorp, Aart
1
2009
Increasing interpretations. Zbl 1191.68368
Zankl, Harald; Middeldorp, Aart
1
2009
Beyond dependency graphs. Zbl 1250.68143
Korp, Martin; Middeldorp, Aart
1
2009
Eliminating dummy elimination. Zbl 0963.68181
Giesl, Jürgen; Middeldorp, Aart
1
2000
Functional and logic programming. 4th Fuji international symposium, FLOPS ’99, Tsukuba, Japan, November 11–13, 1999. Proceedings. Zbl 0929.00068
Middeldorp, Aart (ed.); Sato, Taisuke (ed.)
1
1999
Simple termination of rewrite systems. Zbl 0827.68062
Middeldorp, Aart
1
1995
A sequential reduction strategy. Zbl 0988.68554
Antoy, Sergio; Middeldorp, Aart
1
1994
An introduction to Knuth-Bendix completion. Zbl 0658.68030
Klop, Jan Willem; Middeldorp, Aart
1
1988
CSI: new evidence - a progress report. Zbl 06778416
Nagele, Julian; Felgenhauer, Bertram; Middeldorp, Aart
2
2017
Infinite runs in abstract completion. Zbl 1441.68113
Hirokawa, Nao; Middeldorp, Aart; Sternagel, Christian; Winkler, Sarah
1
2017
Complexity of conditional term rewriting. Zbl 1398.68275
Kop, Cynthia; Middeldorp, Aart; Sternagel, Thomas
1
2017
Automating the first-order theory of rewriting for left-linear right-ground rewrite systems. Zbl 1387.68149
Rapp, Franziska; Middeldorp, Aart
3
2016
Certification of classical confluence results for left-linear term rewrite systems. Zbl 06644750
Nagele, Julian; Middeldorp, Aart
2
2016
AC-KBO revisited. Zbl 1379.68277
Yamada, Akihisa; Winkler, Sarah; Hirokawa, Nao; Middeldorp, Aart
1
2016
Improving automatic confluence analysis of rewrite systems by redundant rules. Zbl 1366.68125
Nagele, Julian; Felgenhauer, Bertram; Middeldorp, Aart
2
2015
Beyond polynomials and Peano arithmetic – automation of elementary and ordinal interpretations. Zbl 1315.68168
Zankl, Harald; Winkler, Sarah; Middeldorp, Aart
2
2015
Conditional complexity. Zbl 1366.68121
Kop, Cynthia; Middeldorp, Aart; Sternagel, Thomas
1
2015
Conditional confluence (system description). Zbl 1416.68181
Sternagel, Thomas; Middeldorp, Aart
5
2014
A new and formalized proof of abstract completion. Zbl 1416.68164
Hirokawa, Nao; Middeldorp, Aart; Sternagel, Christian
1
2014
Uncurrying for termination and complexity. Zbl 1286.68262
Hirokawa, Nao; Middeldorp, Aart; Zankl, Harald
4
2013
Multi-completion with termination tools. Zbl 1362.68253
Winkler, Sarah; Sato, Haruhiko; Middeldorp, Aart; Kurihara, Masahito
1
2013
Ordinals and Knuth-Bendix orders. Zbl 1352.03018
Winkler, Sarah; Zankl, Harald; Middeldorp, Aart
1
2012
CSI – a confluence tool. Zbl 1341.68199
Zankl, Harald; Felgenhauer, Bertram; Middeldorp, Aart
10
2011
Decreasing diagrams and relative termination. Zbl 1243.68199
Hirokawa, Nao; Middeldorp, Aart
7
2011
Labelings for decreasing diagrams. Zbl 1236.68157
Zankl, Harald; Felgenhauer, Bertram; Middeldorp, Aart
5
2011
Joint spectral radius theory for automated complexity analysis of rewrite systems. Zbl 1307.68042
Middeldorp, Aart; Moser, Georg; Neurauter, Friedrich; Waldmann, Johannes; Zankl, Harald
5
2011
Layer systems for proving confluence. Zbl 1246.68136
Felgenhauer, Bertram; Zankl, Harald; Middeldorp, Aart
3
2011
Revisiting matrix interpretations for proving termination of term rewriting. Zbl 1236.68141
Neurauter, Friedrich; Middeldorp, Aart
2
2011
Beyond Peano arithmetic – automatically proving termination of the Goodstein sequence. Zbl 1356.68206
Winkler, Sarah; Zankl, Harald; Middeldorp, Aart
1
2011
AC completion with termination tools. Zbl 1341.68198
Winkler, Sarah; Middeldorp, Aart
1
2011
Satisfiability of non-linear (ir)rational arithmetic. Zbl 1310.68126
Zankl, Harald; Middeldorp, Aart
11
2010
Revisiting matrix interpretations for polynomial derivational complexity of term rewriting. Zbl 1306.68083
Neurauter, Friedrich; Zankl, Harald; Middeldorp, Aart
4
2010
Optimizing \(\text{mkb}_{\text{TT}}\). Zbl 1236.68156
Winkler, Sarah; Sato, Haruhiko; Middeldorp, Aart; Kurihara, Masahito
3
2010
Termination tools in ordered completion. Zbl 1291.68376
Winkler, Sarah; Middeldorp, Aart
3
2010
Polynomial interpretations over the reals do not subsume polynomial interpretations over the integers. Zbl 1236.68142
Neurauter, Friedrich; Middeldorp, Aart
1
2010
Decreasing diagrams and relative termination. Zbl 1291.68347
Hirokawa, Nao; Middeldorp, Aart
1
2010
Finding and certifying loops. Zbl 1274.68153
Zankl, Harald; Sternagel, Christian; Hofbauer, Dieter; Middeldorp, Aart
1
2010
KBO orientability. Zbl 1184.68303
Zankl, Harald; Hirokawa, Nao; Middeldorp, Aart
7
2009
Match-bounds revisited. Zbl 1192.68399
Korp, Martin; Middeldorp, Aart
3
2009
Transforming SAT into termination of rewriting. Zbl 1347.68202
Zankl, Harald; Sternagel, Christian; Middeldorp, Aart
1
2009
Increasing interpretations. Zbl 1191.68368
Zankl, Harald; Middeldorp, Aart
1
2009
Beyond dependency graphs. Zbl 1250.68143
Korp, Martin; Middeldorp, Aart
1
2009
Maximal termination. Zbl 1145.68446
Fuhs, Carsten; Giesl, Jürgen; Middeldorp, Aart; Schneider-Kamp, Peter; Thiemann, René; Zankl, Harald
8
2008
Uncurrying for termination. Zbl 1182.68094
Hirokawa, Nao; Middeldorp, Aart; Zankl, Harald
7
2008
Increasing interpretations. Zbl 1166.68381
Zankl, Harald; Middeldorp, Aart
2
2008
Multi-completion with termination tools. (System description). Zbl 1165.68472
Sato, Haruhiko; Winkler, Sarah; Kurihara, Masahito; Middeldorp, Aart
2
2008
Match-bounds with dependency pairs for proving termination of rewrite systems. Zbl 1156.68430
Korp, Martin; Middeldorp, Aart
2
2008
Root-labeling. Zbl 1145.68453
Sternagel, Christian; Middeldorp, Aart
2
2008
Tyrolean termination tool: techniques and features. Zbl 1111.68048
Hirokawa, Nao; Middeldorp, Aart
25
2007
SAT solving for termination analysis with polynomial interpretations. Zbl 1214.68352
Fuhs, Carsten; Giesl, Jürgen; Middeldorp, Aart; Schneider-Kamp, Peter; Thiemann, René; Zankl, Harald
22
2007
Predictive labeling with dependency pairs using SAT. Zbl 1213.68349
Koprowski, Adam; Middeldorp, Aart
4
2007
Proving termination of rewrite systems using bounds. Zbl 1203.68077
Korp, Martin; Middeldorp, Aart
4
2007
Constraints for argument filterings. Zbl 1131.68468
Zankl, Harald; Hirokawa, Nao; Middeldorp, Aart
3
2007
Satisfying KBO constraints. Zbl 1203.68080
Zankl, Harald; Middeldorp, Aart
3
2007
Predictive labeling. Zbl 1151.68446
Hirokawa, Nao; Middeldorp, Aart
3
2006
Automating the dependency pair method. Zbl 1081.68038
Hirokawa, Nao; Middeldorp, Aart
24
2005
Tyrolean termination tool. Zbl 1078.68656
Hirokawa, Nao; Middeldorp, Aart
12
2005
Decidable call-by-need computations in term rewriting. Zbl 1101.68628
Durand, Iréne; Middeldorp, Aart
8
2005
Processes, terms and cycles: steps on the road to infinity. Essays dedicated to Jan Willem Klop on the occasion of his 60th birthday. Zbl 1097.68007
Middeldorp, Aart (ed.); van Oostrom, Vincent (ed.); van Raamsdonk, Femke (ed.); de Vrijer, Roel (ed.)
3
2005
Dependency pairs revisited. Zbl 1187.68275
Hirokawa, Nao; Middeldorp, Aart
18
2004
Transformation techniques for context-sensitive rewrite systems. Zbl 1104.68056
Giesl, Jürgen; Middeldorp, Aart
17
2004
Polynomial interpretations with negative coefficients. Zbl 1109.68501
Hirokawa, Nao; Middeldorp, Aart
9
2004
Automating the dependency pair method. Zbl 1278.68264
Hirokawa, Nao; Middeldorp, Aart
5
2003
Innermost termination of context-sensitive rewriting. Zbl 1015.68106
Giesl, Jürgen; Middeldorp, Aart
5
2003
Tsukuba termination tool. Zbl 1038.68561
Hirokawa, Nao; Middeldorp, Aart
3
2003
Approximations for strategies and termination. Zbl 1270.68132
Middeldorp, Aart
8
2002
Relative undecidability in term rewriting. II: The confluence hierarchy. Zbl 1012.68097
Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans
6
2002
Relative undecidability in term rewriting. I: The termination hierarchy. Zbl 1012.68096
Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans
5
2002
Approximating dependency graphs using tree automata techniques. Zbl 0988.68162
Middeldorp, Aart
14
2001
On the modularity of deciding call-by-need. Zbl 0978.68071
Durand, Irène; Middeldorp, Aart
2
2001
Logicality of conditional rewrite systems. Zbl 0938.68050
Yamada, T.; Avenhaus, J.; Loría-Sáenz, C.; Middeldorp, A.
4
2000
Equational termination by semantic labelling. Zbl 0973.68094
Ohsaki, Hitoshi; Middeldorp, Aart; Giesl, Jürgen
2
2000
Type introduction for equational rewriting. Zbl 0957.68050
Middeldorp, Aart; Ohsaki, Hitoshi
2
2000
Eliminating dummy elimination. Zbl 0963.68181
Giesl, Jürgen; Middeldorp, Aart
1
2000
Functional and logic programming. 4th Fuji international symposium, FLOPS ’99, Tsukuba, Japan, November 11–13, 1999. Proceedings. Zbl 0929.00068
Middeldorp, Aart (ed.); Sato, Taisuke (ed.)
1
1999
Strongly sequential and inductively sequential term rewriting systems. Zbl 1339.68136
Hanus, Michael; Lucas, Salvador; Middeldorp, Aart
7
1998
A deterministic lazy narrowing calculus. Zbl 0983.68090
Middeldorp, Aart; Okui, Satoshi
6
1998
Simple termination of rewrite systems. Zbl 0903.68106
Middeldorp, Aart; Zantema, Hans
7
1997
Relative undecidability in term rewriting. Zbl 0884.68067
Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans
3
1997
Lazy narrowing: Strong completeness and eager variable elimination. Zbl 0874.68157
Middeldorp, Aart; Okui, Satoshi; Ida, Tetsuo
10
1996
A sequential reduction strategy. Zbl 0872.68080
Antoy, Sergio; Middeldorp, Aart
5
1996
Transforming termination by self-labelling. Zbl 1412.68112
Middeldorp, Aart; Ohsaki, Hitoshi; Zantema, Hans
2
1996
Simple termination is difficult. Zbl 0815.68064
Middeldorp, Aart; Gramlich, Bernhard
10
1995
Transforming termination by self-labelling. Zbl 0939.68684
Ferreira, Maria C. F.; Middeldorp, Aart; Ohsaki, Hitoshi; Zantema, Hans
7
1995
Level-confluence of conditional rewrite systems with extra variables in right-hand sides. Zbl 0939.68679
Suzuki, Taro; Middeldorp, Aart; Ida, Tetsuo
5
1995
Simple termination of rewrite systems. Zbl 0827.68062
Middeldorp, Aart
1
1995
Completeness results for basic narrowing. Zbl 0810.68088
Middeldorp, Aart; Hamoen, Erik
24
1994
Modularity of confluence: A simplified proof. Zbl 0795.68111
Klop, Jan Willem; Middeldorp, Aart; Toyama, Yoshihito; de Vrijer, Roel
8
1994
Completeness of combinations of conditional constructor systems. Zbl 0942.68592
Middeldorp, Aart
2
1994
A sequential reduction strategy. Zbl 0988.68554
Antoy, Sergio; Middeldorp, Aart
1
1994
Modular properties of conditional term rewriting systems. Zbl 0804.68071
Middeldorp, Aart
24
1993
Completeness of combinations of constructor systems. Zbl 0778.68050
Middeldorp, Aart; Toyama, Yoshihito
15
1993
Sequentiality in orthogonal term rewriting systems. Zbl 0746.68047
Klop, Jan Willem; Middeldorp, Aart
16
1991
A sufficient condition for the termination of the direct sum of term rewriting systems. Zbl 0716.68054
Middeldorp, Aart
14
1989
An introduction to Knuth-Bendix completion. Zbl 0658.68030
Klop, Jan Willem; Middeldorp, Aart
1
1988
all top 5

Cited by 264 Authors

33 Middeldorp, Aart
29 Lucas, Salvador
13 Giesl, Jürgen
11 Meseguer Guaita, José
11 Thiemann, René
11 Zantema, Hans
10 Zankl, Harald
9 Alpuente, María
9 Gutiérrez, Raúl
8 Hirokawa, Nao
8 Nishida, Naoki
8 Schneider-Kamp, Peter
7 Moser, Georg
7 Ohlebusch, Enno
7 Sakai, Masahiko
7 Vidal, Germán
7 Winkler, Sarah
6 Felgenhauer, Bertram
6 Iborra, José
5 Ábrahám, Erika
5 Alarcón, Beatriz
5 Durán, Francisco
5 Durand, Irène A.
5 Endrullis, Jörg
5 Escobar, Santiago
5 Falaschi, Moreno
5 Fuhs, Carsten
5 Rubio, Albert
5 Sternagel, Christian
5 Urbain, Xavier
5 Waldmann, Johannes
4 Blanchette, Jasmin Christian
4 Gramlich, Bernhard
4 Hanus, Michael
4 Kirchner, Hélène
4 Klop, Jan Willem
4 Kurihara, Masahito
4 Toyama, Yoshihito
4 Waldmann, Uwe
3 Antoy, Sergio
3 Aoto, Takahito
3 Avanzini, Martin
3 Blanqui, Frédéric
3 Emmes, Fabian
3 Falke, Stephan
3 Geser, Alfons
3 Gnaedig, Isabelle
3 Ida, Tetsuo
3 Jouannaud, Jean-Pierre
3 Kop, Cynthia
3 Kremer, Gereon
3 Marché, Claude
3 Marchiori, Massimo
3 Martí-Oliet, Narciso
3 Moreno, Ginés
3 Rao, M. R. K. Krishna
3 Simonsen, Jakob Grue
3 Ströder, Thomas
3 Yamada, Akihisa
2 Aguirre, Luis Antonio
2 Aschermann, Cornelius
2 Ballis, Demis
2 Borralleras, Cristina
2 Codish, Michael
2 Corzilius, Florian
2 de Vrijer, Roel
2 del Vado Vírseda, Rafael
2 Fernández, Maribel
2 Fernández, Mirtha-Lina
2 Fissore, Olivier
2 Frohn, Florian
2 Genet, Thomas
2 Geuvers, Jan Herman
2 Gonçalves, Ricardo
2 Hensel, Jera
2 Knorr, Matthias
2 Korp, Martin
2 Le Verge, Hervé
2 Leite, João
2 Liu, Jiaxiang
2 Nagashima, Masanori
2 Nagele, Julian
2 Navarro-Marset, Rafael
2 Noschinski, Lars
2 Ogawa, Mizuhito
2 Ohuchi, Azuma
2 Oyamaguchi, Michio
2 Palomino, Miguel
2 Parting, Michael
2 Pita, Isabel
2 Plücker, Martin
2 Rodríguez-Carbonell, Enric
2 Sakabe, Toshiki
2 Salinier, Bruno
2 Saouter, Yannick
2 Sato, Haruhiko
2 Sénizergues, Géraud
2 Swiderski, Stephan
2 Traytel, Dmitry
2 Tung, Vu Xuan
...and 164 more Authors

Citations by Year