Zena M. Ariola

66 papers A* 5A 7B 3C 4Misc 1Journal 28Unranked 17

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Proving and Computing: The Infinite Pigeonhole Principle and Countable Choice. CoRR Zena M. Ariola, Paul Downen, Hugo Herbelin
2025	J	`jnl`	A contextual formalization of structural coinduction. J. Funct. Program. Paul Downen, Zena M. Ariola
2023	J	`jnl`	Classical (co)recursion: Mechanics. J. Funct. Program. Paul Downen, Zena M. Ariola
2023	C	`conf`	Closure Conversion in Little Pieces. PPDP Zachary J. Sullivan, Paul Downen, Zena M. Ariola
2022	—	`ed.`	PEPM 2022: Proceedings of the 2022 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation, Philadelphia, PA, USA, January 17 - 18, 2022 PEPM@POPL Zena M. Ariola, Youyou Cong
2021	J	`jnl`	Classical (Co)Recursion: Mechanics. CoRR Paul Downen, Zena M. Ariola
2021	J	`jnl`	Classical (Co)Recursion: Programming. CoRR Paul Downen, Zena M. Ariola
2021	B	`conf`	Duality in Action (Invited Talk). FSCD Paul Downen, Zena M. Ariola
2021	—	`conf`	Strictly capturing non-strict closures. PEPM@POPL Zachary J. Sullivan, Paul Downen, Zena M. Ariola
2020	B	`ed.`	5th International Conference on Formal Structures for Computation and Deduction, FSCD 2020, Paris, France (Virtual Conference), June 29 - July 6, 2020 FSCD Zena M. Ariola
2020	C	`conf`	A Computational Understanding of Classical (Co)Recursion. PPDP Paul Downen, Zena M. Ariola
2020	J	`jnl`	Abstracting models of strong normalization for classical calculi. J. Log. Algebraic Methods Program. Paul Downen, Philip Johnson-Freyd, Zena M. Ariola
2020	J	`jnl`	Compiling With Classical Connectives. Log. Methods Comput. Sci. Paul Downen, Zena M. Ariola
2020	J	`jnl`	Kinds are calling conventions. Proc. ACM Program. Lang. Paul Downen, Zena M. Ariola, Simon Peyton Jones, Richard A. Eisenberg
2019	A	`conf`	Codata in Action. ESOP Paul Downen, Zachary Sullivan, Zena M. Ariola, Simon Peyton Jones
2019	J	`jnl`	Compiling With Classical Connectives. CoRR Paul Downen, Zena M. Ariola
2019	—	`conf`	Making a faster Curry with extensional types. Haskell@ICFP Paul Downen, Zachary Sullivan, Zena M. Ariola, Simon Peyton Jones
2019	J	`jnl`	The Duality of Classical Intersection and Union Types. Fundam. Informaticae Paul Downen, Zena M. Ariola, Silvia Ghilezan
2018	J	`jnl`	A tutorial on computational classical logic and the sequent calculus. J. Funct. Program. Paul Downen, Zena M. Ariola
2018	B	`conf`	Beyond Polarity: Towards a Multi-Discipline Intermediate Language with Sharing. CSL Paul Downen, Zena M. Ariola
2018	—	`conf`	Uniform Strong Normalization for Multi-discipline Calculi. WRLA Paul Downen, Philip Johnson-Freyd, Zena M. Ariola
2017	J	`jnl`	Call-by-name extensionality and confluence. J. Funct. Program. Philip Johnson-Freyd, Paul Downen, Zena M. Ariola
2017	A*	`conf`	Compiling without continuations. PLDI Luke Maurer, Paul Downen, Zena M. Ariola, Simon L. Peyton Jones
2016	A	`conf`	Sequent calculus as a compiler intermediate language. ICFP Paul Downen, Luke Maurer, Zena M. Ariola, Simon Peyton Jones
2016	—	`conf`	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 Philip Johnson-Freyd, Geoffrey C. Hulette, Zena M. Ariola
2015	—	`conf`	First Class Call Stacks: Exploring Head Reduction. WoC Philip Johnson-Freyd, Paul Downen, Zena M. Ariola
2015	A	`conf`	Structures for structural recursion. ICFP Paul Downen, Philip Johnson-Freyd, Zena M. Ariola
2014	A	`conf`	Compositional semantics for composable continuations: from abortive to delimited control. ICFP Paul Downen, Zena M. Ariola
2014	C	`conf`	Continuations, Processes, and Sharing. PPDP Paul Downen, Luke Maurer, Zena M. Ariola, Daniele Varacca
2014	J	`jnl`	Delimited control and computational effects. J. Funct. Program. Paul Downen, Zena M. Ariola
2014	A	`conf`	The Duality of Construction. ESOP Paul Downen, Zena M. Ariola
2012	A	`conf`	A Systematic Approach to Delimited Control with Multiple Prompts. ESOP Paul Downen, Zena M. Ariola
2012	Misc	`conf`	Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts. FLOPS Zena M. Ariola, Paul Downen, Hugo Herbelin, Keiko Nakata, Alexis Saurin
2011	—	`conf`	Classical Call-by-Need and Duality. TLCA Zena M. Ariola, Hugo Herbelin, Alexis Saurin
2009	J	`jnl`	A type-theoretic foundation of delimited continuations. High. Order Symb. Comput. Zena M. Ariola, Hugo Herbelin, Amr Sabry
2009	J	`jnl`	An overview of the Oregon programming languages summer school. ACM SIGPLAN Notices 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
2009	J	`jnl`	Sequent calculi and abstract machines. ACM Trans. Program. Lang. Syst. Zena M. Ariola, Aaron Bohannon, Amr Sabry
2008	J	`jnl`	Control reduction theories: the benefit of structural substitution. J. Funct. Program. Zena M. Ariola, Hugo Herbelin
2007	J	`jnl`	A proof-theoretic foundation of abortive continuations. High. Order Symb. Comput. Zena M. Ariola, Hugo Herbelin, Amr Sabry
2005	—	`conf`	Skew and Processes, Terms and Cycles Zena M. Ariola, Stefan Blom
2004	A	`conf`	A type-theoretic foundation of continuations and prompts. ICFP Zena M. Ariola, Hugo Herbelin, Amr Sabry
2003	A*	`conf`	Minimal Classical Logic and Control Operators. ICALP Zena M. Ariola, Hugo Herbelin
2002	J	`jnl`	Skew confluence and the lambda calculus with letrec. Ann. Pure Appl. Log. Zena M. Ariola, Stefan Blom
2001	J	`jnl`	From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition. High. Order Symb. Comput. Yong Xiao, Amr Sabry, Zena M. Ariola
2000	J	`jnl`	Bisimilarity in Term Graph Rewriting. Inf. Comput. Zena M. Ariola, Jan Willem Klop, Detlef Plump
2000	J	`jnl`	From Syntactic Theories to Interpreters: A Specification Language and Its Compilation CoRR Yong Xiao, Zena M. Ariola, Michel Mauny
1998	A*	`conf`	Correctness of Monadic State: An Imperative Call-by-Need Calculus. POPL Zena M. Ariola, Amr Sabry
1997	—	`conf`	Confluent rewriting of bisimilar term graphs. EXPRESS Zena M. Ariola, Jan Willem Klop, Detlef Plump
1997	—	`conf`	Correctness of Monadic State: An Imperative Call-by-Need Calculus. HOOTS Zena M. Ariola, Amr Sabry
1997	—	`conf`	Cyclic Lambda Calculi. TACS Zena M. Ariola, Stefan Blom
1997	J	`jnl`	Lambda Calculus with Explicit Recursion. Inf. Comput. Zena M. Ariola, Jan Willem Klop
1997	—	`conf`	Narrowing the Narrowing Space. PLILP Sergio Antoy, Zena M. Ariola
1997	J	`jnl`	The Call-By-Need lambda Calculus. J. Funct. Program. Zena M. Ariola, Matthias Felleisen
1996	J	`jnl`	A Common Intermediate Language and Its Use in Partitioning Concurrent Declarative Programs. New Gener. Comput. Zena M. Ariola, Barton C. Massey, M. Sami, Evan Tick
1996	J	`jnl`	Equational Term Graph Rewriting. Fundam. Informaticae Zena M. Ariola, Jan Willem Klop
1996	J	`jnl`	Relating graph and term rewriting via Böhm models. Appl. Algebra Eng. Commun. Comput. Zena M. Ariola
1995	J	`jnl`	Properties of a First-Order Functional Language with Sharing. Theor. Comput. Sci. Zena M. Ariola, Arvind
1995	A*	`conf`	The Call-by-Need Lambda Calculus. POPL Zena M. Ariola, Matthias Felleisen, John Maraist, Martin Odersky, Philip Wadler
1994	—	`conf`	Compilation of Concurrent Declarative Languages. ICLP Workshop: Integration of Declarative Paradigms Zena M. Ariola, Barton C. Massey, M. Sami, Evan Tick
1994	A*	`conf`	Cyclic Lambda Graph Rewriting LICS Zena M. Ariola, Jan Willem Klop
1994	—	`conf`	Syntactic Definitions of Undefined: On Defining the Undefined. TACS Zena M. Ariola, Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
1993	—	`conf`	Order-of-evaluation Analysis for Destructive Updates in Strict Functional Languages with Flat Aggregates. FPCA A. V. S. Sastry, William D. Clinger, Zena M. Ariola
1993	—	`conf`	Relating Graph and Term Rewriting via Böhm Models. RTA Zena M. Ariola
1991	C	`conf`	A Syntactic Approach to Program Transformations. PEPM Zena M. Ariola, Arvind
1991	—	`conf`	Compilation of Id. LCPC Zena M. Ariola, Arvind
1989	—	`conf`	P-TAC: A Parallel Intermediate Language. FPCA Zena M. Ariola, Arvind