Zena M. Ariola

Publication Activity (10 Years)

Years Active: 1989-2023
Publications (10 Years): 23

Top Topics

Datalog Programs

Sequent Calculus

Safety Critical

Update Operators

Top Venues

J. Funct. Program.

Publications

Zachary J. Sullivan, Paul Downen, Zena M. Ariola
Closure Conversion in Little Pieces. PPDP (2023)
Paul Downen, Zena M. Ariola
Classical (co)recursion: Mechanics. J. Funct. Program. 33 (2023)
Paul Downen, Zena M. Ariola
Duality in Action (Invited Talk). FSCD (2021)
Paul Downen, Zena M. Ariola
Classical (Co)Recursion: Programming. CoRR (2021)
Zachary J. Sullivan, Paul Downen, Zena M. Ariola
Strictly capturing non-strict closures. PEPM@POPL (2021)
Paul Downen, Zena M. Ariola
Classical (Co)Recursion: Mechanics. CoRR (2021)
Paul Downen, Zena M. Ariola
Compiling With Classical Connectives. Log. Methods Comput. Sci. 16 (3) (2020)
Paul Downen, Philip Johnson-Freyd, Zena M. Ariola
Abstracting models of strong normalization for classical calculi. J. Log. Algebraic Methods Program. 111 (2020)
Paul Downen, Zena M. Ariola
A Computational Understanding of Classical (Co)Recursion. PPDP (2020)
Paul Downen, Zena M. Ariola, Simon Peyton Jones, Richard A. Eisenberg
Kinds are calling conventions. Proc. ACM Program. Lang. 4 (ICFP) (2020)
Paul Downen, Zena M. Ariola, Silvia Ghilezan
The Duality of Classical Intersection and Union Types. Fundam. Informaticae 170 (1-3) (2019)
Paul Downen, Zachary Sullivan, Zena M. Ariola, Simon Peyton Jones
Codata in Action. ESOP (2019)
Paul Downen, Zachary Sullivan, Zena M. Ariola, Simon Peyton Jones
Making a faster Curry with extensional types. Haskell@ICFP (2019)
Paul Downen, Zena M. Ariola
Compiling With Classical Connectives. CoRR (2019)
Paul Downen, Zena M. Ariola
Beyond Polarity: Towards a Multi-Discipline Intermediate Language with Sharing. CSL (2018)
Paul Downen, Zena M. Ariola
A tutorial on computational classical logic and the sequent calculus. J. Funct. Program. 28 (2018)
Paul Downen, Philip Johnson-Freyd, Zena M. Ariola
Uniform Strong Normalization for Multi-discipline Calculi. WRLA@ETAPS (2018)
Luke Maurer, Paul Downen, Zena M. Ariola, Simon L. Peyton Jones
Compiling without continuations. PLDI (2017)
Philip Johnson-Freyd, Paul Downen, Zena M. Ariola
Call-by-name extensionality and confluence. J. Funct. Program. 27 (2017)
Paul Downen, Luke Maurer, Zena M. Ariola, Simon Peyton Jones
Sequent calculus as a compiler intermediate language. ICFP (2016)
Philip Johnson-Freyd, Geoffrey C. Hulette, Zena M. Ariola
Verification by Way of Refinement: A Case Study in the Use of Coq and TLA in the Design of a Safety Critical System. FMICS-AVoCS (2016)
Paul Downen, Philip Johnson-Freyd, Zena M. Ariola
Structures for structural recursion. ICFP (2015)
Philip Johnson-Freyd, Paul Downen, Zena M. Ariola
First Class Call Stacks: Exploring Head Reduction. WoC (2015)
Paul Downen, Zena M. Ariola
The Duality of Construction. ESOP (2014)
Paul Downen, Zena M. Ariola
Delimited control and computational effects. J. Funct. Program. 24 (1) (2014)
Paul Downen, Luke Maurer, Zena M. Ariola, Daniele Varacca
Continuations, Processes, and Sharing. PPDP (2014)
Paul Downen, Zena M. Ariola
Compositional semantics for composable continuations: from abortive to delimited control. ICFP (2014)
Zena M. Ariola, Paul Downen, Hugo Herbelin, Keiko Nakata, Alexis Saurin
Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts. FLOPS (2012)
Paul Downen, Zena M. Ariola
A Systematic Approach to Delimited Control with Multiple Prompts. ESOP (2012)
Zena M. Ariola, Hugo Herbelin, Alexis Saurin
Classical Call-by-Need and Duality. TLCA (2011)
Jim Allen, Zena M. Ariola, Pierre-Louis Curien, Matthew Fluet, Jeffrey S. Foster, Dan Grossman, Robert Harper, Hugo Herbelin, Yannis Smaragdakis, David Walker, Steve Zdancewic
An overview of the Oregon programming languages summer school. ACM SIGPLAN Notices 44 (11) (2009)
Zena M. Ariola, Aaron Bohannon, Amr Sabry
Sequent calculi and abstract machines. ACM Trans. Program. Lang. Syst. 31 (4) (2009)
Zena M. Ariola, Hugo Herbelin, Amr Sabry
A type-theoretic foundation of delimited continuations. High. Order Symb. Comput. 22 (3) (2009)
Zena M. Ariola, Hugo Herbelin
Control reduction theories: the benefit of structural substitution. J. Funct. Program. 18 (3) (2008)
Zena M. Ariola, Hugo Herbelin, Amr Sabry
A proof-theoretic foundation of abortive continuations. High. Order Symb. Comput. 20 (4) (2007)
Zena M. Ariola, Stefan Blom
-Skew Confluence and Abstract Böhm Semantics. Processes, Terms and Cycles (2005)
Zena M. Ariola, Hugo Herbelin, Amr Sabry
A type-theoretic foundation of continuations and prompts. ICFP (2004)
Zena M. Ariola, Hugo Herbelin
Minimal Classical Logic and Control Operators. ICALP (2003)
Zena M. Ariola, Stefan Blom
Skew confluence and the lambda calculus with letrec. Ann. Pure Appl. Log. 117 (1-3) (2002)
Yong Xiao, Amr Sabry, Zena M. Ariola
From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition. High. Order Symb. Comput. 14 (4) (2001)
Yong Xiao, Zena M. Ariola, Michel Mauny
From Syntactic Theories to Interpreters: A Specification Language and Its Compilation CoRR (2000)
Zena M. Ariola, Jan Willem Klop, Detlef Plump
Bisimilarity in Term Graph Rewriting. Inf. Comput. 156 (1-2) (2000)
Zena M. Ariola, Amr Sabry
Correctness of Monadic State: An Imperative Call-by-Need Calculus. POPL (1998)
Sergio Antoy, Zena M. Ariola
Narrowing the Narrowing Space. PLILP (1997)
Zena M. Ariola, Matthias Felleisen
The Call-By-Need lambda Calculus. J. Funct. Program. 7 (3) (1997)
Zena M. Ariola, Amr Sabry
Correctness of Monadic State: An Imperative Call-by-Need Calculus. Electron. Notes Theor. Comput. Sci. 10 (1997)
Zena M. Ariola, Stefan Blom
Cyclic Lambda Calculi. TACS (1997)
Zena M. Ariola, Jan Willem Klop
Lambda Calculus with Explicit Recursion. Inf. Comput. 139 (2) (1997)
Zena M. Ariola, Jan Willem Klop, Detlef Plump
Confluent rewriting of bisimilar term graphs. EXPRESS (1997)
Zena M. Ariola, Barton C. Massey, M. Sami, Evan Tick
A Common Intermediate Language and Its Use in Partitioning Concurrent Declarative Programs. New Gener. Comput. 14 (3) (1996)
Zena M. Ariola
Relating graph and term rewriting via Böhm models. Appl. Algebra Eng. Commun. Comput. 7 (5) (1996)
Zena M. Ariola, Jan Willem Klop
Equational Term Graph Rewriting. Fundam. Informaticae 26 (3/4) (1996)
Zena M. Ariola, Matthias Felleisen, John Maraist, Martin Odersky, Philip Wadler
The Call-by-Need Lambda Calculus. POPL (1995)
Zena M. Ariola, Arvind
Properties of a First-Order Functional Language with Sharing. Theor. Comput. Sci. 146 (1&2) (1995)
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)
Zena M. Ariola, Jan Willem Klop
Cyclic Lambda Graph Rewriting LICS (1994)
Zena M. Ariola, Barton C. Massey, M. Sami, Evan Tick
Compilation of Concurrent Declarative Languages. ICLP Workshop: Integration of Declarative Paradigms (1994)
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)
Zena M. Ariola
Relating Graph and Term Rewriting via Böhm Models. RTA (1993)
Zena M. Ariola, Arvind
A Syntactic Approach to Program Transformations. PEPM (1991)
Zena M. Ariola, Arvind
Compilation of Id. LCPC (1991)
Zena M. Ariola, Arvind
P-TAC: A Parallel Intermediate Language. FPCA (1989)