Zena Ariola
Zena Ariola
Verified email at cs.uoregon.edu
Title
Cited by
Cited by
Year
A call-by-need lambda calculus
ZM Ariola, J Maraist, M Odersky, M Felleisen, P Wadler
Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of …, 1995
4571995
Equational term graph rewriting
ZM Ariola, JW Klop
Fundamenta Informaticae 26 (3, 4), 207-240, 1996
1681996
Minimal classical logic and control operators
ZM Ariola, H Herbelin
International Colloquium on Automata, Languages, and Programming, 871-885, 2003
1032003
Lambda calculus with explicit recursion
ZM Ariola, JW Klop
Information and computation 139 (2), 154-233, 1997
881997
Cyclic lambda calculi
ZM Ariola, S Blom
International Symposium on Theoretical Aspects of Computer Software, 77-106, 1997
801997
Cyclic lambda graph rewriting
ZM Ariola, JW Klop
Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, 416-425, 1994
801994
Properties of a first-order functional language with sharing
ZM Ariola
Theoretical Computer Science 146 (1-2), 69-108, 1995
541995
Skew confluence and the lambda calculus with letrec
ZM Ariola, S Blom
Annals of pure and applied logic 117 (1-3), 95-168, 2002
522002
A type-theoretic foundation of delimited continuations
ZM Ariola, H Herbelin, A Sabry
Higher-order and symbolic computation 22 (3), 233-273, 2009
492009
A type-theoretic foundation of continuations and prompts
ZM Ariola, H Herbelin, A Sabry
ACM SIGPLAN Notices 39 (9), 40-53, 2004
472004
Order-of-evaluation analysis for destructive updates in strict functional languages with flat aggregates
AVS Sastry, W Clinger, Z Ariola
Proceedings of the conference on Functional programming languages and …, 1993
461993
P-TAC: a parallel intermediate language
Z Ariola
Proceedings of the fourth international conference on Functional programming …, 1989
351989
A proof-theoretic foundation of abortive continuations
ZM Ariola, H Herbelin, A Sabry
Higher-order and symbolic computation 20 (4), 403-429, 2007
342007
Classical call-by-need and duality
ZM Ariola, H Herbelin, A Saurin
International Conference on Typed Lambda Calculi and Applications, 27-44, 2011
322011
Correctness of monadic state: An imperative call-by-need calculus
ZM Ariola, A Sabry
Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of …, 1998
311998
A syntactic approach to program transformations
ZM Ariola
ACM Sigplan Notices 26 (9), 116-129, 1991
311991
Sequent calculi and abstract machines
ZM Ariola, A Bohannon, A Sabry
ACM Transactions on Programming Languages and Systems (TOPLAS) 31 (4), 1-48, 2009
302009
From syntactic theories to interpreters: Automating the proof of unique decomposition
Y Xiao, A Sabry, ZM Ariola
Higher-Order and Symbolic Computation 14 (4), 387-409, 2001
302001
Classical call-by-need sequent calculi: The unity of semantic artifacts
ZM Ariola, P Downen, H Herbelin, K Nakata, A Saurin
International Symposium on Functional and Logic Programming, 32-46, 2012
282012
Bisimilarity in term graph rewriting
ZM Ariola, JW Klop, D Plump
Information and Computation 156 (1-2), 2-24, 2000
282000
The system can't perform the operation now. Try again later.
Articles 1–20