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 (3-4), 213-253, 1994
1681994
SAT solving for termination analysis with polynomial interpretations
C Fuhs, J Giesl, A Middeldorp, P Schneider-Kamp, R Thiemann, H Zankl
International Conference on Theory and Applications of Satisfiability …, 2007
1552007
Tyrolean termination tool: Techniques and features
N Hirokawa, A Middeldorp
Information and Computation, 2007
1512007
Tyrolean termination tool 2
M Korp, C Sternagel, H Zankl, A Middeldorp
International Conference on Rewriting Techniques and Applications, 295-304, 2009
1472009
Modular properties of term rewriting systems
A Middeldorp
Vrije Universiteit Amsterdam, 1990
1431990
Automating the dependency pair method
N Hirokawa, A Middeldorp
Information and computation, 2005
1332005
Sequentiality in orthogonal term rewriting systems
JW Klop, A Middeldorp
Journal of symbolic computation 12 (2), 161-195, 1991
1081991
Dependency pairs revisited
N Hirokawa, A Middeldorp
International Conference on Rewriting Techniques and Applications, 249-268, 2004
1012004
Lazy narrowing: Strong completeness and eager variable elimination
A Middeldorp, S Okui, T Ida
Theoretical Computer Science 167 (1), 95-130, 1996
941996
Call by need computations to root-stable form
A Middeldorp
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of …, 1997
931997
A sufficient condition for the termination of the direct sum of term rewriting systems
A Middeldorp
[1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science …, 1989
911989
Transformation techniques for context-sensitive rewrite systems
J Giesl, A Middeldorp
Journal of Functional Programming 14 (4), 379-427, 2004
852004
Completeness of combinations of constructor systems
A Middeldorp, Y Toyama
International Conference on Rewriting Techniques and Applications, 188-199, 1991
821991
Satisfiability of non-linear (ir) rational arithmetic
H Zankl, A Middeldorp
International Conference on Logic for Programming Artificial Intelligence …, 2010
722010
Simple termination of rewrite systems
A Middeldorp, H Zantema
Theoretical Computer Science 175 (1), 127-158, 1997
701997
Modular aspects of properties of term rewriting systems related to normal forms
A Middeldorp
International Conference on Rewriting Techniques and Applications, 263-277, 1989
631989
A deterministic lazy narrowing calculus
A Middeldorp, S Okui
Journal of Symbolic Computation 25 (6), 733-757, 1998
611998
Level-confluence of conditional rewrite systems with extra variables in right-hand sides
T Suzuki, A Middeldorp, T Ida
International Conference on Rewriting Techniques and Applications, 179-193, 1995
601995
CSI–A confluence tool
H Zankl, B Felgenhauer, A Middeldorp
International Conference on Automated Deduction, 499-505, 2011
572011
Decidable call by need computations in term rewriting
I Durand, A Middeldorp
International Conference on Automated Deduction, 4-18, 1997
561997
The system can't perform the operation now. Try again later.
Articles 1–20