Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Middeldorp, Aart"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Layer systems for proving confluence
Bertram Felgenhauer
,
Harald Zankl
,
Aart Middeldorp
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 288-299
Match-bounds revisited
Martin Korp
,
Aart Middeldorp
Information and Computation
207
(11), 2009, pp. 1259-1283
Tyrolean termination tool: Techniques and features
Nao Hirokawa
,
Aart Middeldorp
Information and Computation
205
(4), 2007, pp. 474-511
Decidable call-by-need computations in term rewriting
Irène Durand
,
Aart Middeldorp
Information and Computation
196
(2), 2005, pp. 95-126
Automating the dependency pair method
Nao Hirokawa
,
Aart Middeldorp
Information and Computation
199
(1-2), 2005, pp. 172-199
Relative undecidability in term rewriting: I. The termination hierarchy
Alfons Geser
,
Aart Middeldorp
,
Enno Ohlebusch
,
Hans Zantema
Information and Computation
178
(1), 2002, pp. 101-131
Relative undecidability in term rewriting: II. The confluence hierarchy
Alfons Geser
,
Aart Middeldorp
,
Enno Ohlebusch
,
Hans Zantema
Information and Computation
178
(1), 2002, pp. 132-148
Type introduction for equational rewriting
Aart Middeldorp
,
Hitoshi Ohsaki
Acta Informatica
36
(12), 2000, pp. 1007-1029
Logicality of conditional rewrite systems
Toshiyuki Yamada
,
Jürgen Avenhaus
,
Carlos Loría-Sáenz
,
Aart Middeldorp
Theoretical Computer Science
236
(1-2), 2000, pp. 209-232
Strongly sequential and inductively sequential term rewriting systems
Michael Hanus
,
Salvador Lucas
,
Aart Middeldorp
Information Processing Letters
67
(1), 1998, pp. 1-8
A deterministic lazy narrowing calculus
Aart Middeldorp
,
Satoshi Okui
Journal Symbolic Computation
25
(6), 1998, pp. 733-757
Simple termination of rewrite systems
Aart Middeldorp
,
Hans Zantema
Theoretical Computer Science
175
(1), 1997, pp. 127-158
Type introduction for equational rewriting
Hitoshi Ohsaki
,
Aart Middeldorp
Lecture Notes in Computer Science
1234
, 1997, pp. 283-293
A seqyential reduction strategy
Sergio Antoy
,
Aart Middeldorp
Theoretical Computer Science
165
(1), 1996, pp. 75-95
Lazy narrowing: Strong completeness and eager variable elimination
Aart Middeldorp
,
Satoshi Okui
,
Tetsuo Ida
Theoretical Computer Science
167
(1-2), 1996, pp. 95-130
Modularity of confluence: A simplified proof
Jan Willem Klop
,
Aart Middeldorp
,
Yoshihito Toyama
,
Roel de Vrijer
Information Processing Letters
49
, 1994, pp. 101-109
Completeness of combinations of conditional constructor systems
Aart Middeldorp
Journal Symbolic Computation
17
(1), 1994, pp. 3-21
Completeness of combinations of constructor systems
Aart Middeldorp
,
Yoshihito Toyama
Journal Symbolic Computation
15
(3), 1993, pp. 331-348
Modular properties of conditional term rewriting systems
Aart Middeldorp
Information and Computation
104
(1), 1993, May, pp. 110-158
Sequentiality in orthogonal term rewriting systems
Jan Willem Klop
,
Aart Middeldorp
Journal Symbolic Computation
12
(2), 1991, pp. 161-195