default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZena M. Ariola
Person information
- affiliation: University of Oregon, Eugene, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j22]Paul Downen
, Zena M. Ariola:
Classical (co)recursion: Mechanics. J. Funct. Program. 33: e4 (2023)- [c36]Zachary J. Sullivan, Paul Downen, Zena M. Ariola:
Closure Conversion in Little Pieces. PPDP 2023: 10:1-10:13 - 2022
- [e2]Zena M. Ariola, Youyou Cong:
PEPM 2022: Proceedings of the 2022 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation, Philadelphia, PA, USA, January 17 - 18, 2022. ACM 2022, ISBN 978-1-4503-9188-7 [contents] - 2021
- [c35]Paul Downen, Zena M. Ariola:
Duality in Action (Invited Talk). FSCD 2021: 1:1-1:32 - [c34]Zachary J. Sullivan, Paul Downen, Zena M. Ariola:
Strictly capturing non-strict closures. PEPM@POPL 2021: 74-89 - [i4]Paul Downen, Zena M. Ariola:
Classical (Co)Recursion: Programming. CoRR abs/2103.06913 (2021) - [i3]Paul Downen, Zena M. Ariola:
Classical (Co)Recursion: Mechanics. CoRR abs/2103.08521 (2021) - 2020
- [j21]Paul Downen, Philip Johnson-Freyd, Zena M. Ariola:
Abstracting models of strong normalization for classical calculi. J. Log. Algebraic Methods Program. 111: 100512 (2020) - [j20]Paul Downen, Zena M. Ariola:
Compiling With Classical Connectives. Log. Methods Comput. Sci. 16(3) (2020) - [j19]Paul Downen, Zena M. Ariola, Simon Peyton Jones, Richard A. Eisenberg:
Kinds are calling conventions. Proc. ACM Program. Lang. 4(ICFP): 104:1-104:29 (2020) - [c33]Paul Downen, Zena M. Ariola:
A Computational Understanding of Classical (Co)Recursion. PPDP 2020: 5:1-5:13 - [e1]Zena M. Ariola:
5th International Conference on Formal Structures for Computation and Deduction, FSCD 2020, June 29-July 6, 2020, Paris, France (Virtual Conference). LIPIcs 167, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-155-9 [contents]
2010 – 2019
- 2019
- [j18]Paul Downen, Zena M. Ariola, Silvia Ghilezan:
The Duality of Classical Intersection and Union Types. Fundam. Informaticae 170(1-3): 39-92 (2019) - [c32]Paul Downen, Zachary Sullivan, Zena M. Ariola, Simon Peyton Jones:
Codata in Action. ESOP 2019: 119-146 - [c31]Paul Downen, Zachary Sullivan, Zena M. Ariola, Simon Peyton Jones:
Making a faster Curry with extensional types. Haskell@ICFP 2019: 58-70 - [i2]Paul Downen, Zena M. Ariola:
Compiling With Classical Connectives. CoRR abs/1907.13227 (2019) - 2018
- [j17]Paul Downen, Zena M. Ariola:
A tutorial on computational classical logic and the sequent calculus. J. Funct. Program. 28: e3 (2018) - [c30]Paul Downen, Zena M. Ariola:
Beyond Polarity: Towards a Multi-Discipline Intermediate Language with Sharing. CSL 2018: 21:1-21:23 - [c29]Paul Downen, Philip Johnson-Freyd, Zena M. Ariola:
Uniform Strong Normalization for Multi-discipline Calculi. WRLA@ETAPS 2018: 205-225 - 2017
- [j16]Philip Johnson-Freyd, Paul Downen, Zena M. Ariola:
Call-by-name extensionality and confluence. J. Funct. Program. 27: e12 (2017) - [c28]Luke Maurer, Paul Downen, Zena M. Ariola, Simon L. Peyton Jones:
Compiling without continuations. PLDI 2017: 482-494 - 2016
- [c27]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: 205-213 - [c26]Paul Downen, Luke Maurer, Zena M. Ariola, Simon Peyton Jones:
Sequent calculus as a compiler intermediate language. ICFP 2016: 74-88 - 2015
- [c25]Paul Downen, Philip Johnson-Freyd, Zena M. Ariola:
Structures for structural recursion. ICFP 2015: 127-139 - [c24]Philip Johnson-Freyd, Paul Downen, Zena M. Ariola:
First Class Call Stacks: Exploring Head Reduction. WoC 2015: 18-35 - 2014
- [j15]Paul Downen, Zena M. Ariola:
Delimited control and computational effects. J. Funct. Program. 24(1): 1-55 (2014) - [c23]Paul Downen, Zena M. Ariola:
The Duality of Construction. ESOP 2014: 249-269 - [c22]Paul Downen, Zena M. Ariola:
Compositional semantics for composable continuations: from abortive to delimited control. ICFP 2014: 109-122 - [c21]Paul Downen, Luke Maurer, Zena M. Ariola, Daniele Varacca:
Continuations, Processes, and Sharing. PPDP 2014: 69-80 - 2012
- [c20]Paul Downen, Zena M. Ariola:
A Systematic Approach to Delimited Control with Multiple Prompts. ESOP 2012: 234-253 - [c19]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
- [c18]Zena M. Ariola, Hugo Herbelin, Alexis Saurin:
Classical Call-by-Need and Duality. TLCA 2011: 27-44
2000 – 2009
- 2009
- [j14]Zena M. Ariola, Hugo Herbelin, Amr Sabry:
A type-theoretic foundation of delimited continuations. High. Order Symb. Comput. 22(3): 233-273 (2009) - [j13]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): 1-3 (2009) - [j12]Zena M. Ariola, Aaron Bohannon, Amr Sabry:
Sequent calculi and abstract machines. ACM Trans. Program. Lang. Syst. 31(4): 13:1-13:48 (2009) - 2008
- [j11]Zena M. Ariola, Hugo Herbelin:
Control reduction theories: the benefit of structural substitution. J. Funct. Program. 18(3): 373-419 (2008) - 2007
- [j10]Zena M. Ariola, Hugo Herbelin, Amr Sabry:
A proof-theoretic foundation of abortive continuations. High. Order Symb. Comput. 20(4): 403-429 (2007) - 2005
- [c17]Zena M. Ariola, Stefan Blom:
Skew and omega-Skew Confluence and Abstract Böhm Semantics. Processes, Terms and Cycles 2005: 368-403 - 2004
- [c16]Zena M. Ariola, Hugo Herbelin, Amr Sabry:
A type-theoretic foundation of continuations and prompts. ICFP 2004: 40-53 - 2003
- [c15]Zena M. Ariola, Hugo Herbelin:
Minimal Classical Logic and Control Operators. ICALP 2003: 871-885 - 2002
- [j9]Zena M. Ariola, Stefan Blom:
Skew confluence and the lambda calculus with letrec. Ann. Pure Appl. Log. 117(1-3): 95-168 (2002) - 2001
- [j8]Yong Xiao, Amr Sabry, Zena M. Ariola:
From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition. High. Order Symb. Comput. 14(4): 387-409 (2001) - 2000
- [j7]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
- [c14]Zena M. Ariola, Amr Sabry:
Correctness of Monadic State: An Imperative Call-by-Need Calculus. POPL 1998: 62-74 - 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) - [c13]Sergio Antoy, Zena M. Ariola:
Narrowing the Narrowing Space. PLILP 1997: 1-15 - [c12]Zena M. Ariola, Stefan Blom:
Cyclic Lambda Calculi. TACS 1997: 77-106 - [c11]Zena M. Ariola, Jan Willem Klop, Detlef Plump:
Confluent rewriting of bisimilar term graphs. EXPRESS 1997: 19 - [c10]Zena M. Ariola, Amr Sabry:
Correctness of Monadic State: An Imperative Call-by-Need Calculus. HOOTS 1997: 53 - 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. Informaticae 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 Gener. 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]Zena M. Ariola, Jan Willem Klop:
Cyclic Lambda Graph Rewriting. LICS 1994: 416-425 - [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]Zena M. Ariola:
Relating Graph and Term Rewriting via Böhm Models. RTA 1993: 183-197 - 1991
- [c3]Zena M. Ariola, Arvind:
Compilation of Id. LCPC 1991: 99-121 - [c2]Zena M. Ariola, Arvind:
A Syntactic Approach to Program Transformations. PEPM 1991: 116-129
1980 – 1989
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 00:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
