Searching for authors named "Aart Middeldorp" – sorted by Relevance.
-
Call by Need Computations to Root-Stable Form
- Call by Need Computations to Root-Stable Form Aart Middeldorp Institute of Information Sciences
- Cited by 42 (5 self) – Add To MetaCart
-
Context-Freeness and Infinitary Normalization
- Context-Freeness and Infinitary Normalization 1 Aart Middeldorp University of Tsukuba In [2
- Cited by 2 (0 self) – Add To MetaCart
-
Approximating dependency graphs using tree automata techniques
- Approximating Dependency Graphs using Tree Automata Techniques ⋆ Aart Middeldorp Institute
- Cited by 17 (4 self) – Add To MetaCart
-
Completeness of Combinations of Conditional Constructor Systems
- Systems 1;2 AART MIDDELDORP Institute of Information Sciences and Electronics University of Tsukuba
- Cited by 13 (2 self) – Add To MetaCart
-
On the Complexity of Deciding Call-by-Need
- On the Complexity of Deciding Call-by-Need ? Ir`ene Durand 1?? and Aart Middeldorp 2 1
- Add To MetaCart
-
A Deterministic Lazy Narrowing Calculus
- J. Symbolic Computation (1999) 25, 733{757 A Deterministic Lazy Narrowing Calculus y AART
- Cited by 23 (5 self) – Add To MetaCart
-
A Complete Selection Function for Lazy Conditional Narrowing
- A Complete Selection Function for Lazy Conditional Narrowing Taro Suzuki 1 and Aart Middeldorp 2
- Cited by 3 (1 self) – Add To MetaCart
-
New Completeness Results For Lazy Conditional Narrowing
- New Completeness Results for Lazy Conditional Narrowing Mircea Marin and Aart Middeldorp Institute
- Cited by 4 (3 self) – Add To MetaCart
-
Decidable Call by Need Computations in Term Rewriting (Extended Abstract)
- # de Bordeaux I, France Aart Middeldorp University of Tsukuba, Japan Abstract In this paper we
- Cited by 15 (3 self) – Add To MetaCart
-
Polynomial interpretations with negative coefficients
- Polynomial Interpretations with Negative Coefficients Nao Hirokawa and Aart Middeldorp Institute
- Cited by 4 (1 self) – Add To MetaCart

