2008 |
29 | EE | Zena M. Ariola,
Hugo Herbelin:
Control reduction theories: the benefit of structural substitution.
J. Funct. Program. 18(3): 373-419 (2008) |
2007 |
28 | EE | Zena M. Ariola,
Hugo Herbelin,
Amr Sabry:
A proof-theoretic foundation of abortive continuations.
Higher-Order and Symbolic Computation 20(4): 403-429 (2007) |
2005 |
27 | EE | Zena M. Ariola,
Stefan Blom:
Skew and omega-Skew Confluence and Abstract Böhm Semantics.
Processes, Terms and Cycles 2005: 368-403 |
2004 |
26 | EE | Zena M. Ariola,
Hugo Herbelin,
Amr Sabry:
A type-theoretic foundation of continuations and prompts.
ICFP 2004: 40-53 |
2003 |
25 | EE | Zena M. Ariola,
Hugo Herbelin:
Minimal Classical Logic and Control Operators.
ICALP 2003: 871-885 |
2002 |
24 | | Zena M. Ariola,
Stefan Blom:
Skew confluence and the lambda calculus with letrec.
Ann. Pure Appl. Logic 117(1-3): 95-168 (2002) |
2001 |
23 | | Yong Xiao,
Amr Sabry,
Zena M. Ariola:
From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition.
Higher-Order and Symbolic Computation 14(4): 387-409 (2001) |
2000 |
22 | EE | Yong Xiao,
Zena M. Ariola,
Michel Mauny:
From Syntactic Theories to Interpreters: A Specification Language and Its Compilation
CoRR cs.PL/0009030: (2000) |
21 | | Zena M. Ariola,
Jan Willem Klop,
Detlef Plump:
Bisimilarity in Term Graph Rewriting.
Inf. Comput. 156(1-2): 2-24 (2000) |
1998 |
20 | EE | Zena M. Ariola,
Amr Sabry:
Correctness of Monadic State: An Imperative Call-by-Need Calculus.
POPL 1998: 62-74 |
1997 |
19 | | Sergio Antoy,
Zena M. Ariola:
Narrowing the Narrowing Space.
PLILP 1997: 1-15 |
18 | | Zena M. Ariola,
Stefan Blom:
Cyclic Lambda Calculi.
TACS 1997: 77-106 |
17 | EE | Zena M. Ariola,
Amr Sabry:
Correctness of Monadic State: An Imperative Call-by-Need Calculus.
Electr. Notes Theor. Comput. Sci. 10: (1997) |
16 | EE | Zena M. Ariola,
Jan Willem Klop,
Detlef Plump:
Confluent rewriting of bisimilar term graphs.
Electr. Notes Theor. Comput. Sci. 7: (1997) |
15 | | Zena M. Ariola,
Jan Willem Klop:
Lambda Calculus with Explicit Recursion.
Inf. Comput. 139(2): 154-233 (1997) |
14 | | Zena M. Ariola,
Matthias Felleisen:
The Call-By-Need lambda Calculus.
J. Funct. Program. 7(3): 265-301 (1997) |
1996 |
13 | EE | Zena M. Ariola:
Relating Graph and Term Rewriting via Böhm Models.
Appl. Algebra Eng. Commun. Comput. 7(5): 401-426 (1996) |
12 | | Zena M. Ariola,
Jan Willem Klop:
Equational Term Graph Rewriting.
Fundam. Inform. 26(3/4): 207-240 (1996) |
11 | | Zena M. Ariola,
Barton C. Massey,
M. Sami,
Evan Tick:
A Common Intermediate Language and Its Use in Partitioning Concurrent Declarative Programs.
New Generation Comput. 14(3): 281-315 (1996) |
1995 |
10 | | Zena M. Ariola,
Matthias Felleisen,
John Maraist,
Martin Odersky,
Philip Wadler:
The Call-by-Need Lambda Calculus.
POPL 1995: 233-246 |
9 | EE | Zena M. Ariola,
Arvind:
Properties of a First-Order Functional Language with Sharing.
Theor. Comput. Sci. 146(1&2): 69-108 (1995) |
1994 |
8 | EE | Zena M. Ariola,
Barton C. Massey,
M. Sami,
Evan Tick:
Compilation of Concurrent Declarative Languages.
ICLP Workshop: Integration of Declarative Paradigms 1994: 120-134 |
7 | | Zena M. Ariola,
Jan Willem Klop:
Cyclic Lambda Graph Rewriting
LICS 1994: 416-425 |
6 | | Zena M. Ariola,
Richard Kennaway,
Jan Willem Klop,
M. Ronan Sleep,
Fer-Jan de Vries:
Syntactic Definitions of Undefined: On Defining the Undefined.
TACS 1994: 543-554 |
1993 |
5 | | A. V. S. Sastry,
William D. Clinger,
Zena M. Ariola:
Order-of-evaluation Analysis for Destructive Updates in Strict Functional Languages with Flat Aggregates.
FPCA 1993: 266-275 |
4 | | Zena M. Ariola:
Relating Graph and Term Rewriting via Böhm Models.
RTA 1993: 183-197 |
1991 |
3 | | Zena M. Ariola,
Arvind:
Compilation of Id.
LCPC 1991: 99-121 |
2 | | Zena M. Ariola,
Arvind:
A Syntactic Approach to Program Transformations.
PEPM 1991: 116-129 |
1989 |
1 | EE | Zena M. Ariola,
Arvind:
P-TAC: A Parallel Intermediate Language.
FPCA 1989: 230-242 |