Follow
Aart Middeldorp
Aart Middeldorp
Verified email at uibk.ac.at - Homepage
Title
Cited by
Cited by
Year
Completeness results for basic narrowing
A Middeldorp, E Hamoen
Applicable Algebra in Engineering, Communication and Computing 5, 213-253, 1994
1891994
Tyrolean termination tool 2
M Korp, C Sternagel, H Zankl, A Middeldorp
Rewriting Techniques and Applications: 20th International Conference, RTA …, 2009
1822009
SAT solving for termination analysis with polynomial interpretations
C Fuhs, J Giesl, A Middeldorp, P Schneider-Kamp, R Thiemann, H Zankl
Theory and Applications of Satisfiability Testing–SAT 2007: 10th …, 2007
1772007
Tyrolean termination tool: Techniques and features
N Hirokawa, A Middeldorp
Information and Computation 205 (4), 474-511, 2007
1572007
Modular properties of term rewriting systems
A Middeldorp
Vrije Universiteit Amsterdam, 1990
1561990
Automating the dependency pair method
N Hirokawa, A Middeldorp
Information and computation 199 (1-2), 172-199, 2005
1382005
Sequentiality in orthogonal term rewriting systems
JW Klop, A Middeldorp
Journal of symbolic computation 12 (2), 161-195, 1991
1211991
Dependency pairs revisited
N Hirokawa, A Middeldorp
Rewriting Techniques and Applications: 15th International Conference, RTA …, 2004
1062004
Lazy narrowing: Strong completeness and eager variable elimination
A Middeldorp, S Okui, T Ida
Theoretical Computer Science 167 (1-2), 95-130, 1996
1051996
A sufficient condition for the termination of the direct sum of term rewriting systems
A Middeldorp
Proceedings. Fourth Annual Symposium on Logic in Computer Science, 396,397 …, 1989
1021989
Call by need computations to root-stable form
A Middeldorp
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of …, 1997
1001997
Completeness of combinations of constructor systems
A Middeldorp, Y Toyama
International Conference on Rewriting Techniques and Applications, 188-199, 1991
901991
Transformation techniques for context-sensitive rewrite systems
J Giesl, A Middeldorp
Journal of Functional Programming 14 (4), 379-427, 2004
882004
Satisfiability of non-linear (ir) rational arithmetic
H Zankl, A Middeldorp
Logic for Programming, Artificial Intelligence, and Reasoning: 16th …, 2010
832010
Simple termination of rewrite systems
A Middeldorp, H Zantema
Theoretical Computer Science 175 (1), 127-158, 1997
791997
Modular aspects of properties of term rewriting systems related to normal forms
A Middeldorp
Rewriting Techniques and Applications: 3rd International Conference, RTA-89 …, 1989
731989
Level-confluence of conditional rewrite systems with extra variables in right-hand sides
T Suzuki, A Middeldorp, T Ida
Rewriting Techniques and Applications: 6th International Conference, RTA-95 …, 1995
721995
CSI–A confluence tool
H Zankl, B Felgenhauer, A Middeldorp
Automated Deduction–CADE-23: 23rd International Conference on Automated …, 2011
712011
A deterministic lazy narrowing calculus
A Middeldorp, S Okui
Journal of Symbolic Computation 25 (6), 733-757, 1998
651998
Counterexamples to completeness results for basic narrowing
A Middeldorp, E Hamoen
International Conference on Algebraic and Logic Programming, 244-258, 1992
641992
The system can't perform the operation now. Try again later.
Articles 1–20