Travelled to:1 × Canada
1 × Estonia
1 × France
1 × Italy
1 × The Netherlands
10 × USA
Collaborated with:M.Felleisen O.Kiselyov Z.M.Ariola C.Swords C.Shan R.P.James M.Semmelroth J.Launchbury P.Wadler C.Flanagan B.F.Duba J.Carette ∅ S.Tobin-Hochstadt R.Garcia A.Lumsdaine H.Herbelin S.E.Ganz W.Taha J.Hughes L.Pareto D.P.Friedman
Talks about:continu (5) monad (5) type (4) comput (3) macro (3) transform (2) delimit (2) correct (2) essenc (2) effect (2)
Person: Amr Sabry
DBLP: Sabry:Amr
Contributed to:
2015
20122009200620052004200119991998199719961996
199419931993
1992
2016
20032013Wrote 19 papers:
- ICFP-2015-SwordsST #communication #contract #monitoring
- Expressing contract monitors as patterns of communication (CS, AS, STH), pp. 387–399.
- POPL-2012-JamesS
- Information effects (RPJ, AS), pp. 73–84.
- POPL-2009-GarciaLS #evaluation #lazy evaluation
- Lazy evaluation and delimited control (RG, AL, AS), pp. 153–164.
- ICFP-2006-KiselyovSS
- Delimited dynamic binding (OK, CcS, AS), pp. 26–37.
- ICFP-2005-KiselyovSFS #backtracking #monad
- Backtracking, interleaving, and terminating monad transformers: (OK, CcS, DPF, AS), pp. 192–203.
- ICFP-2004-AriolaHS #continuation
- A type-theoretic foundation of continuations and prompts (ZMA, HH, AS), pp. 40–53.
- ICFP-2001-GanzST #generative #metaprogramming #multi #type safety
- Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML (SEG, AS, WT), pp. 74–85.
- ICFP-1999-SemmelrothS #encapsulation #ml #monad
- Monadic Encapsulation in ML (MS, AS), pp. 8–17.
- POPL-1998-AriolaS #calculus #call-by #correctness #imperative #monad
- Correctness of Monadic State: An Imperative Call-by-Need Calculus (ZMA, AS), pp. 62–74.
- ICFP-1997-LaunchburyS #axiom #monad #type safety
- Monadic State: Axiomatization and Type Safety (JL, AS), pp. 227–238.
- ICFP-1996-SabryW #call-by
- A Reflection on Call-by-Value (AS, PW), pp. 13–24.
- POPL-1996-HughesPS #correctness #proving #using
- Proving the Correctness of Reactive Systems Using Sized Types (JH, LP, AS), pp. 410–423.
- PLDI-1994-SabryF #analysis #continuation #data flow #question
- Is Continuation-Passing Useful for Data Flow Analysis? (AS, MF), pp. 1–12.
- Best-of-PLDI-1993-FlanaganSDF93a #compilation #continuation
- The essence of compiling with continuations (with retrospective) (CF, AS, BFD, MF), pp. 502–514.
- PLDI-1993-FlanaganSDF #compilation #continuation
- The Essence of Compiling with Continuations (CF, AS, BFD, MF), pp. 237–247.
- LFP-1992-SabryF #continuation #reasoning #source code
- Reasoning About Programs in Continuation-Passing Style (AS, MF), pp. 288–298.
- ESOP-2016-CaretteS
- Computing with Semirings and Weak Rig Groupoids (JC, AS), pp. 123–148.
- Haskell-2003-Sabry #haskell #modelling #quantum
- Modeling quantum computing in Haskell (AS), pp. 39–49.
- Haskell-2013-KiselyovSS #monad
- Extensible effects: an alternative to monad transformers (OK, AS, CS), pp. 59–70.