2009 |
16 | EE | Irène Durand,
Aart Middeldorp:
On the Complexity of Deciding Call-by-Need
CoRR abs/0901.0869: (2009) |
15 | EE | Irène Durand,
Géraud Sénizergues:
Bottom-up rewriting for words and terms
CoRR abs/0903.2554: (2009) |
2007 |
14 | EE | Irène Durand,
Géraud Sénizergues:
Bottom-Up Rewriting Is Inverse Recognizability Preserving.
RTA 2007: 107-121 |
2005 |
13 | EE | Irène Durand:
A Tool for Term Rewrite Systems and Tree Automata.
Electr. Notes Theor. Comput. Sci. 124(2): 29-49 (2005) |
12 | EE | Irène Durand,
Aart Middeldorp:
Decidable call-by-need computations in term rewriting.
Inf. Comput. 196(2): 95-126 (2005) |
2002 |
11 | EE | Irène Durand:
Autowrite: A Tool for Checking Properties of Term Rewriting Systems.
RTA 2002: 371-375 |
2001 |
10 | EE | Irène Durand,
Aart Middeldorp:
On the Modularity of Deciding Call-by-Need.
FoSSaCS 2001: 199-213 |
1997 |
9 | | Irène Durand,
Aart Middeldorp:
Decidable Call by Need Computations in term Rewriting (Extended Abstract).
CADE 1997: 4-18 |
1994 |
8 | | Irène Durand,
Bruno Salinier:
Constructor Equivalent Term Rewriting Systems are Strongly Sequential: A Direct Proof.
Inf. Process. Lett. 52(3): 137-145 (1994) |
7 | | Irène Durand:
Bounded, Strongly Sequential and Forward-Branching Term Rewriting Systems.
J. Symb. Comput. 18(4): 319-352 (1994) |
1993 |
6 | | Irène Durand,
Bruno Salinier:
Constructor Equivalent Term Rewriting Systems.
Inf. Process. Lett. 47(3): 131-137 (1993) |
1991 |
5 | | Irène Durand,
David Sherman,
Robert Strandh:
Partial Evaluation of an Intermediate Language for Equational Programs.
JTASPEFT/WSA 1991: 98-106 |
4 | | David Sherman,
Robert Strandh,
Irène Durand:
Optimization of Equational Programs Using Partial Evaluation.
PEPM 1991: 72-82 |
1987 |
3 | | Christian Percebois,
Ivan Futó,
Irène Durand,
C. Simon,
B. Bonhoure:
Simulation Results of a Multiprocessor Prolog Architecture Based on a Distributed and/or Graph.
TAPSOFT, Vol.2 1987: 126-139 |
1986 |
2 | | Christian Percebois,
Ivan Futó,
Irène Durand,
C. Simon,
B. Bonhoure:
Résolution parallèle de sous-buts indépendants dans le graphe de connexion de R. Kowalski.
SPLT 1986: 553-570 |
1985 |
1 | | Christian Percebois,
Irène Durand,
C. Simon:
COALA: un réseau d'acteurs pour une architecture multiprocesseur Prolog.
SPLT 1985 |