| 2009 |
|---|
| 76 | EE | Irène Durand,
Aart Middeldorp:
On the Complexity of Deciding Call-by-Need
CoRR abs/0901.0869: (2009) |
| 75 | EE | Aart Middeldorp:
Preface.
Electr. Notes Theor. Comput. Sci. 237: 1-2 (2009) |
| 2008 |
|---|
| 74 | EE | Harald Zankl,
Aart Middeldorp:
Increasing Interpretations.
AISC/MKM/Calculemus 2008: 191-205 |
| 73 | EE | Haruhiko Sato,
Sarah Winkler,
Masahito Kurihara,
Aart Middeldorp:
Multi-completion with Termination Tools (System Description).
IJCAR 2008: 306-312 |
| 72 | EE | Martin Korp,
Aart Middeldorp:
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems.
LATA 2008: 321-332 |
| 71 | EE | Nao Hirokawa,
Aart Middeldorp,
Harald Zankl:
Uncurrying for Termination.
LPAR 2008: 667-681 |
| 70 | EE | Carsten Fuhs,
Jürgen Giesl,
Aart Middeldorp,
Peter Schneider-Kamp,
René Thiemann,
Harald Zankl:
Maximal Termination.
RTA 2008: 110-125 |
| 69 | EE | Christian Sternagel,
Aart Middeldorp:
Root-Labeling.
RTA 2008: 336-350 |
| 68 | EE | René Thiemann,
Aart Middeldorp:
Innermost Termination of Rewrite Systems by Labeling.
Electr. Notes Theor. Comput. Sci. 204: 3-19 (2008) |
| 2007 |
|---|
| 67 | EE | Adam Koprowski,
Aart Middeldorp:
Predictive Labeling with Dependency Pairs Using SAT.
CADE 2007: 410-425 |
| 66 | EE | Peter Schneider-Kamp,
Carsten Fuhs,
René Thiemann,
Jürgen Giesl,
Elena Annov,
Michael Codish,
Aart Middeldorp,
Harald Zankl:
Implementing RPO and POLO using SAT.
Deduction and Decision Procedures 2007 |
| 65 | EE | Martin Korp,
Aart Middeldorp:
Proving Termination of Rewrite Systems Using Bounds.
RTA 2007: 273-287 |
| 64 | EE | Harald Zankl,
Aart Middeldorp:
Satisfying KBO Constraints.
RTA 2007: 389-403 |
| 63 | EE | Carsten Fuhs,
Jürgen Giesl,
Aart Middeldorp,
Peter Schneider-Kamp,
René Thiemann,
Harald Zankl:
SAT Solving for Termination Analysis with Polynomial Interpretations.
SAT 2007: 340-354 |
| 62 | EE | Harald Zankl,
Nao Hirokawa,
Aart Middeldorp:
Constraints for Argument Filterings.
SOFSEM (1) 2007: 579-590 |
| 61 | EE | Nao Hirokawa,
Aart Middeldorp:
Tyrolean termination tool: Techniques and features.
Inf. Comput. 205(4): 474-511 (2007) |
| 2006 |
|---|
| 60 | EE | Nao Hirokawa,
Aart Middeldorp:
Predictive Labeling.
RTA 2006: 313-327 |
| 59 | EE | Harald Zankl,
Aart Middeldorp:
Satisfying KBO Constraints
CoRR abs/cs/0608032: (2006) |
| 2005 |
|---|
| 58 | | Aart Middeldorp,
Vincent van Oostrom,
Femke van Raamsdonk,
Roel C. de Vrijer:
Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday
Springer 2005 |
| 57 | EE | Nao Hirokawa,
Aart Middeldorp:
Tyrolean Termination Tool.
RTA 2005: 175-184 |
| 56 | EE | Irène Durand,
Aart Middeldorp:
Decidable call-by-need computations in term rewriting.
Inf. Comput. 196(2): 95-126 (2005) |
| 55 | EE | Nao Hirokawa,
Aart Middeldorp:
Automating the dependency pair method.
Inf. Comput. 199(1-2): 172-199 (2005) |
| 2004 |
|---|
| 54 | EE | Nao Hirokawa,
Aart Middeldorp:
Polynomial Interpretations with Negative Coefficients.
AISC 2004: 185-198 |
| 53 | EE | Mircea Marin,
Aart Middeldorp:
New completeness results for lazy conditional narrowing.
PPDP 2004: 120-131 |
| 52 | EE | Nao Hirokawa,
Aart Middeldorp:
Dependency Pairs Revisited.
RTA 2004: 249-268 |
| 51 | EE | Jürgen Giesl,
Aart Middeldorp:
Transformation techniques for context-sensitive rewrite systems.
J. Funct. Program. 14(4): 379-427 (2004) |
| 2003 |
|---|
| 50 | EE | Nao Hirokawa,
Aart Middeldorp:
Automating the Dependency Pair Method.
CADE 2003: 32-46 |
| 49 | EE | Nao Hirokawa,
Aart Middeldorp:
Tsukuba Termination Tool.
RTA 2003: 311-320 |
| 48 | EE | Aart Middeldorp:
Preface.
Inf. Comput. 183(2): 139 (2003) |
| 2002 |
|---|
| 47 | EE | Jürgen Giesl,
Aart Middeldorp:
Innermost Termination of Context-Sensitive Rewriting.
Developments in Language Theory 2002: 231-244 |
| 46 | EE | Aart Middeldorp:
Approximations for Strategies and Termination.
Electr. Notes Theor. Comput. Sci. 70(6): (2002) |
| 45 | EE | Alfons Geser,
Aart Middeldorp,
Enno Ohlebusch,
Hans Zantema:
Relative Undecidability in Term Rewriting: I. The Termination Hierarchy.
Inf. Comput. 178(1): 101-131 (2002) |
| 44 | EE | Alfons Geser,
Aart Middeldorp,
Enno Ohlebusch,
Hans Zantema:
Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy.
Inf. Comput. 178(1): 132-148 (2002) |
| 43 | EE | Aart Middeldorp,
Taro Suzuki,
Mohamed Hamada:
Complete Selection Functions for a Lazy Conditional Narrowing Calculus.
Journal of Functional and Logic Programming 2002: (2002) |
| 2001 |
|---|
| 42 | | Aart Middeldorp:
Rewriting Techniques and Applications, 12th International Conference, RTA 2001, Utrecht, The Netherlands, May 22-24, 2001, Proceedings
Springer 2001 |
| 41 | EE | Taro Suzuki,
Aart Middeldorp:
A Complete Selection Function for Lazy Conditional Narrowing.
FLOPS 2001: 201-215 |
| 40 | EE | Irène Durand,
Aart Middeldorp:
On the Modularity of Deciding Call-by-Need.
FoSSaCS 2001: 199-213 |
| 39 | EE | Aart Middeldorp:
Approximating Dependency Graphs Using Tree Automata Techniques.
IJCAR 2001: 593-610 |
| 2000 |
|---|
| 38 | | Jürgen Giesl,
Aart Middeldorp:
Eliminating Dummy Elimination.
CADE 2000: 309-323 |
| 37 | EE | Hitoshi Ohsaki,
Aart Middeldorp,
Jürgen Giesl:
Equational Termination by Semantic Labelling.
CSL 2000: 457-471 |
| 36 | EE | Aart Middeldorp,
Hitoshi Ohsaki:
Type Introduction for Equational Rewriting.
Acta Inf. 36(12): 1007-1029 (2000) |
| 35 | EE | Toshiyuki Yamada,
Jürgen Avenhaus,
Carlos Loría-Sáenz,
Aart Middeldorp:
Logicality of conditional rewrite systems.
Theor. Comput. Sci. 236(1-2): 209-232 (2000) |
| 1999 |
|---|
| 34 | | Aart Middeldorp,
Taisuke Sato:
Functional and Logic Programming, 4th Fuji International Symposium, FLOPS'99, Tsukuba, Japan, November 11-13, 1999, Proceedings
Springer 1999 |
| 33 | | Aart Middeldorp:
Term Rewriting.
CSL 1999: 577 |
| 32 | EE | Jürgen Giesl,
Aart Middeldorp:
Transforming Context-Sensitive Rewrite Systems.
RTA 1999: 271-287 |
| 1998 |
|---|
| 31 | EE | Michael Hanus,
Salvador Lucas,
Aart Middeldorp:
Strongly Sequential and Inductively Sequential Term Rewriting Systems.
Inf. Process. Lett. 67(1): 1-8 (1998) |
| 30 | | Aart Middeldorp,
Satoshi Okui:
A Deterministic Lazy Narrowing Calculus.
J. Symb. Comput. 25(6): 733-757 (1998) |
| 1997 |
|---|
| 29 | | Irène Durand,
Aart Middeldorp:
Decidable Call by Need Computations in term Rewriting (Extended Abstract).
CADE 1997: 4-18 |
| 28 | | Hitoshi Ohsaki,
Aart Middeldorp:
Type Introduction for Equational Rewriting.
LFCS 1997: 283-293 |
| 27 | EE | Aart Middeldorp:
Call by Need Computations to Root-Stable Form.
POPL 1997: 94-105 |
| 26 | | Toshiyuki Yamada,
Jürgen Avenhaus,
Carlos Loría-Sáenz,
Aart Middeldorp:
Logicality of Conditional Rewrite Systems.
TAPSOFT 1997: 141-152 |
| 25 | | Alfons Geser,
Aart Middeldorp,
Enno Ohlebusch,
Hans Zantema:
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules.
TAPSOFT 1997: 237-248 |
| 24 | EE | Aart Middeldorp,
Hans Zantema:
Simple Termination of Rewrite Systems.
Theor. Comput. Sci. 175(1): 127-158 (1997) |
| 1996 |
|---|
| 23 | | Aart Middeldorp,
Hitoshi Ohsaki,
Hans Zantema:
Transforming Termination by Self-Labelling.
CADE 1996: 373-387 |
| 22 | | Alfons Geser,
Aart Middeldorp,
Enno Ohlebusch,
Hans Zantema:
Relative Undecidability in Term Rewriting.
CSL 1996: 150-166 |
| 21 | EE | Sergio Antoy,
Aart Middeldorp:
A Sequential Reduction Strategy.
Theor. Comput. Sci. 165(1): 75-95 (1996) |
| 20 | EE | Aart Middeldorp,
Satoshi Okui,
Tetsuo Ida:
Lazy Narrowing: Strong Completeness and Eager Variable Elimination.
Theor. Comput. Sci. 167(1&2): 95-130 (1996) |
| 1995 |
|---|
| 19 | | Koichi Nakahara,
Aart Middeldorp,
Tetsuo Ida:
A Complete Narrowing Calculus for Higher-Order Functional Logic Programming
PLILP 1995: 97-114 |
| 18 | | Taro Suzuki,
Aart Middeldorp,
Tetsuo Ida:
Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides.
RTA 1995: 179-193 |
| 17 | | Satoshi Okui,
Aart Middeldorp,
Tetsuo Ida:
Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract).
TAPSOFT 1995: 394-408 |
| 16 | | Aart Middeldorp,
Bernhard Gramlich:
Simple Termination Difficult.
Appl. Algebra Eng. Commun. Comput. 6: 115-128 (1995) |
| 1994 |
|---|
| 15 | | Sergio Antoy,
Aart Middeldorp:
A Sequential Reduction Strategy.
ALP 1994: 168-185 |
| 14 | | Aart Middeldorp,
Hans Zantema:
Simple Termination Revisited.
CADE 1994: 451-465 |
| 13 | | Aart Middeldorp,
Erik Hamoen:
Completness Results for Basic Narrowing.
Appl. Algebra Eng. Commun. Comput. 5: 213-253 (1994) |
| 12 | | Jan Willem Klop,
Aart Middeldorp,
Yoshihito Toyama,
Roel C. de Vrijer:
Modularity of Confluence: A Simplified Proof.
Inf. Process. Lett. 49(2): 101-109 (1994) |
| 11 | | Aart Middeldorp:
Completeness of Combinations of Conditional Constructor Systems.
J. Symb. Comput. 17(1): 3-21 (1994) |
| 1993 |
|---|
| 10 | | Aart Middeldorp,
Bernhard Gramlich:
Simple Termination is Difficult.
RTA 1993: 228-242 |
| 9 | | Aart Middeldorp:
Modular Properties of Conditional Term Rewriting Systems
Inf. Comput. 104(1): 110-158 (1993) |
| 8 | | Aart Middeldorp,
Yoshihito Toyama:
Completeness of Combinations of Constructor Systems.
J. Symb. Comput. 15(3): 331-348 (1993) |
| 1992 |
|---|
| 7 | | Aart Middeldorp,
Erik Hamoen:
Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract).
ALP 1992: 244-258 |
| 6 | | Aart Middeldorp:
Completeness of Combinations of Conditional Constructor Systems.
CTRS 1992: 82-96 |
| 1991 |
|---|
| 5 | | Aart Middeldorp,
Yoshihito Toyama:
Completeness of Combinations of Constructor Systems.
RTA 1991: 188-199 |
| 4 | | Jan Willem Klop,
Aart Middeldorp:
Sequentiality in Orthogonal Term Rewriting Systems.
J. Symb. Comput. 12(2): 161-196 (1991) |
| 1990 |
|---|
| 3 | | Aart Middeldorp:
Confluence of the Disjoint Union of Conditional Term Rewriting Systems.
CTRS 1990: 295-306 |
| 1989 |
|---|
| 2 | | Aart Middeldorp:
A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems
LICS 1989: 396-401 |
| 1 | | Aart Middeldorp:
Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms.
RTA 1989: 263-277 |
