Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Zena M. Ariola
2010 – today
- 2012
[c18]Paul Downen, Zena M. Ariola: A Systematic Approach to Delimited Control with Multiple Prompts. ESOP 2012: 234-253- [c17]Zena M. Ariola, Paul Downen, Hugo Herbelin, Keiko Nakata, Alexis Saurin: Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts. FLOPS 2012: 32-46
- 2011
- [c16]
2000 – 2009
- 2009
- [j16]Zena M. Ariola, Hugo Herbelin, Amr Sabry: A type-theoretic foundation of delimited continuations. Higher-Order and Symbolic Computation 22(3): 233-273 (2009)
- [j15]Jim Allen, Zena M. Ariola, Pierre-Louis Curien, Matthew Fluet, Jeff Foster, Dan Grossman, Robert Harper, Hugo Herbelin, Yannis Smaragdakis, David Walker, Steve Zdancewic: An overview of the Oregon programming languages summer school. SIGPLAN Notices 44(11): 1-3 (2009)
- [j14]Zena M. Ariola, Aaron Bohannon, Amr Sabry: Sequent calculi and abstract machines. ACM Trans. Program. Lang. Syst. 31(4) (2009)
- 2008
- [j13]Zena M. Ariola, Hugo Herbelin: Control reduction theories: the benefit of structural substitution. J. Funct. Program. 18(3): 373-419 (2008)
- 2007
- [j12]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
- [c15]Zena M. Ariola, Stefan Blom: Skew and omega-Skew Confluence and Abstract Böhm Semantics. Processes, Terms and Cycles 2005: 368-403
- 2004
- [c14]Zena M. Ariola, Hugo Herbelin, Amr Sabry: A type-theoretic foundation of continuations and prompts. ICFP 2004: 40-53
- 2003
- [c13]
- 2002
- [j11]Zena M. Ariola, Stefan Blom: Skew confluence and the lambda calculus with letrec. Ann. Pure Appl. Logic 117(1-3): 95-168 (2002)
- 2001
- [j10]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
- [j9]Zena M. Ariola, Jan Willem Klop, Detlef Plump: Bisimilarity in Term Graph Rewriting. Inf. Comput. 156(1-2): 2-24 (2000)
- [i1]Yong Xiao, Zena M. Ariola, Michel Mauny: From Syntactic Theories to Interpreters: A Specification Language and Its Compilation. CoRR cs.PL/0009030 (2000)
1990 – 1999
- 1998
- [c12]
- 1997
- [j8]Zena M. Ariola, Jan Willem Klop, Detlef Plump: Confluent rewriting of bisimilar term graphs. Electr. Notes Theor. Comput. Sci. 7: 19 (1997)
- [j7]Zena M. Ariola, Amr Sabry: Correctness of Monadic State: An Imperative Call-by-Need Calculus. Electr. Notes Theor. Comput. Sci. 10: 53 (1997)
- [j6]Zena M. Ariola, Jan Willem Klop: Lambda Calculus with Explicit Recursion. Inf. Comput. 139(2): 154-233 (1997)
- [j5]Zena M. Ariola, Matthias Felleisen: The Call-By-Need lambda Calculus. J. Funct. Program. 7(3): 265-301 (1997)
- [c11]
- [c10]
- 1996
- [j4]Zena M. Ariola: Relating graph and term rewriting via Böhm models. Appl. Algebra Eng. Commun. Comput. 7(5): 401-426 (1996)
- [j3]Zena M. Ariola, Jan Willem Klop: Equational Term Graph Rewriting. Fundam. Inform. 26(3/4): 207-240 (1996)
- [j2]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
- [j1]Zena M. Ariola, Arvind: Properties of a First-Order Functional Language with Sharing. Theor. Comput. Sci. 146(1&2): 69-108 (1995)
- [c9]Zena M. Ariola, Matthias Felleisen, John Maraist, Martin Odersky, Philip Wadler: The Call-by-Need Lambda Calculus. POPL 1995: 233-246
- 1994
- [c8]Zena M. Ariola, Barton C. Massey, M. Sami, Evan Tick: Compilation of Concurrent Declarative Languages. ICLP Workshop: Integration of Declarative Paradigms 1994: 120-134
- [c7]
- [c6]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
- [c5]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
- [c4]
- 1991
- [c3]
- [c2]
1980 – 1989
- 1989
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:53 CET by the dblp team