Travelled to:1 × Denmark
1 × Estonia
1 × Japan
1 × Serbia
1 × Sweden
1 × The Netherlands
2 × Canada
2 × France
3 × United Kingdom
4 × USA
Collaborated with:P.Downen H.Herbelin Arvind A.Sabry A.Saurin L.Maurer S.Antoy J.W.Klop ∅ Z.Sullivan S.P.Jones P.Johnson-Freyd A.V.S.Sastry W.D.Clinger D.Varacca S.L.P.Jones K.Nakata M.Felleisen J.Maraist M.Odersky P.Wadler
Talks about:continu (4) need (4) call (4) languag (3) control (3) classic (3) intermedi (2) structur (2) calculus (2) approach (2)
Person: Zena M. Ariola
DBLP: Ariola:Zena_M=
Contributed to:
2015
20142014
20142012
2012
20112004
2003
199819971995
1994
1993
1993
199119892019
2018
2019
2017Wrote 21 papers:
- ICFP-2015-DownenJA #recursion
- Structures for structural recursion (PD, PJF, ZMA), pp. 127–139.
- ESOP-2014-DownenA
- The Duality of Construction (PD, ZMA), pp. 249–269.
- ICFP-2014-DownenA #composition #continuation #semantics
- Compositional semantics for composable continuations: from abortive to delimited control (PD, ZMA), pp. 109–122.
- PPDP-2014-DownenMAV #continuation #process
- Continuations, Processes, and Sharing (PD, LM, ZMA, DV), pp. 69–80.
- ESOP-2012-DownenA #approach #multi
- A Systematic Approach to Delimited Control with Multiple Prompts (PD, ZMA), pp. 234–253.
- FLOPS-2012-AriolaDHNS #calculus #call-by #semantics
- Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts (ZMA, PD, HH, KN, AS), pp. 32–46.
- TLCA-2011-AriolaHS #call-by
- Classical Call-by-Need and Duality (ZMA, HH, AS), pp. 27–44.
- ICFP-2004-AriolaHS #continuation
- A type-theoretic foundation of continuations and prompts (ZMA, HH, AS), pp. 40–53.
- ICALP-2003-AriolaH #logic
- Minimal Classical Logic and Control Operators (ZMA, HH), pp. 871–885.
- POPL-1998-AriolaS #calculus #call-by #correctness #imperative #monad
- Correctness of Monadic State: An Imperative Call-by-Need Calculus (ZMA, AS), pp. 62–74.
- PLILP-1997-AntoyA
- Narrowing the Narrowing Space (SA, ZMA), pp. 1–15.
- POPL-1995-AriolaFMOW #call-by #λ-calculus
- The Call-by-Need λ Calculus (ZMA, MF, JM, MO, PW), pp. 233–246.
- LICS-1994-AriolaK #graph grammar
- Cyclic λ Graph Rewriting (ZMA, JWK), pp. 416–425.
- FPCA-1993-SastryCA #analysis #functional #strict
- Order-of-evaluation Analysis for Destructive Updates in Strict Functional Languages with Flat Aggregates (AVSS, WDC, ZMA), pp. 266–275.
- RTA-1993-Ariola #graph #modelling #term rewriting
- Relating Graph and Term Rewriting via Böhm Models (ZMA), pp. 183–197.
- PEPM-1991-AriolaA #approach #program transformation
- A Syntactic Approach to Program Transformations (ZMA, A), pp. 116–129.
- FPCA-1989-AriolaA #named #parallel
- P-TAC: A Parallel Intermediate Language (ZMA, A), pp. 230–242.
- ESOP-2019-DownenSAJ
- Codata in Action (PD, ZS, ZMA, SPJ), pp. 119–146.
- CSL-2018-DownenA #multi #towards
- Beyond Polarity: Towards a Multi-Discipline Intermediate Language with Sharing (PD, ZMA), p. 23.
- Haskell-2019-DownenSAJ #performance
- Making a faster Curry with extensional types (PD, ZS, ZMA, SPJ), pp. 58–70.
- PLDI-2017-MaurerDAJ #compilation #continuation
- Compiling without continuations (LM, PD, ZMA, SLPJ), pp. 482–494.