BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
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 DBLP: Ariola:Zena_M=

Contributed to:

ICFP 20152015
ESOP 20142014
ICFP 20142014
PPDP 20142014
ESOP 20122012
FLOPS 20122012
TLCA 20112011
ICFP 20042004
ICALP 20032003
POPL 19981998
PLILP 19971997
POPL 19951995
LICS 19941994
FPCA 19931993
RTA 19931993
PEPM 19911991
FPCA 19891989
ESOP 20192019
CSL 20182018
Haskell 20192019
PLDI 20172017

Wrote 21 papers:

ICFP-2015-DownenJA #recursion
Structures for structural recursion (PD, PJF, ZMA), pp. 127–139.
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.
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.
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.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.