Follow
Aart Middeldorp
Aart Middeldorp
Professor of Computer Science, Innsbruck University
Verified email at uibk.ac.at
Title
Cited by
Cited by
Year
Modular aspects of properties of term rewriting systems related to normal forms
A Middeldorp
Rewriting Techniques and Applications: 3rd International Conference, RTA-89 …, 1989
711989
Decreasing diagrams and relative termination
N Hirokawa, A Middeldorp
Journal of Automated Reasoning 47 (4), 481-501, 2011
502011
Modular properties of conditional term rewriting systems
A Middeldorp
Information and Computation 104 (1), 110-158, 1993
431993
Uncurrying for termination and complexity
N Hirokawa, A Middeldorp, H Zankl
Journal of Automated Reasoning 50 (3), 279-315, 2013
242013
Commutation via relative termination
N Hirokawa, A Middeldorp
Proc. 2nd International Workshop on Confluence, 29-33, 2013
152013
Tutorial on Term Rewriting
A Middeldorp
CSL, 577, 1999
111999
Normalized completion revisited
S Winkler, A Middeldorp
24th International Conference on Rewriting Techniques and Applications (RTA …, 2013
92013
Revisiting matrix interpretations for proving termination of term rewriting
F Neurauter, A Middeldorp
22nd International Conference on Rewriting Techniques and Applications (RTA'11), 2011
82011
Beyond Peano arithmetic–automatically proving termination of the Goodstein sequence
S Winkler, H Zankl, A Middeldorp
24th International Conference on Rewriting Techniques and Applications (RTA …, 2013
72013
Processes, terms and cycles: steps on the road to infinity: essays dedicated to Jan Willem Klop on the occasion of his 60th birthday
JW Klop
Springer Science & Business Media, 2005
62005
Uncurrying for innermost termination and derivational complexity
H Zankl, N Hirokawa, A Middeldorp
arXiv preprint arXiv:1102.3733, 2011
52011
Automating ordinal interpretations
H Zankl, S Winkler, A Middeldorp
12th International Workshop on Termination (WST 2012), 94, 2012
32012
Unique normal forms for disjoint unions of conditional term rewriting systems
A Middeldorp
Department of Computer Science [CS], 1990
31990
A sufficient condition for the termination of the direct sum of term rewriting systems
A Middeldorp
Vrije Universiteit, Faculteit Wiskunde en Informatica, 1988
31988
Satisfiability of non-linear arithmetic over algebraic numbers
H Zankl, R Thiemann, A Middeldorp
SCSS 2010 Symbolic Computation in Software Science, 19, 2010
22010
Equational reasoning for termination of rewriting
H Zankl, A Middeldorp
Proc. 10th WST, 112-115, 2009
22009
Strategies for Rewrite Systems: Normalization and Optimality (Languages, Algebra and Computer Systems)
A Middeldorp
数理解析研究所講究録 1106, 149-160, 1999
21999
Context-freeness and infinitary normalization
A Middeldorp
Proc. of 14th Japanese Term Rewriting Meeting. Nara Institute of Science and …, 1999
21999
Logicality of conditional rewrite systems
T Yamada, J Avenhaus, C Loría-Sáenz, A Middeldorp
TAPSOFT'97: Theory and Practice of Software Development: 7th International …, 1997
21997
On the domain and dimension hierarchy of matrix interpretations
F Neurauter, A Middeldorp
Logic for Programming, Artificial Intelligence, and Reasoning: 18th …, 2012
12012
The system can't perform the operation now. Try again later.
Articles 1–20