| 2007 |
|---|
| 25 | EE | Thorsten Altenkirch,
Jonathan Grattage,
Juliana K. Vizzotto,
Amr Sabry:
An Algebra of Pure Quantum Programming.
Electr. Notes Theor. Comput. Sci. 170: 23-47 (2007) |
| 24 | EE | Zena M. Ariola,
Hugo Herbelin,
Amr Sabry:
A proof-theoretic foundation of abortive continuations.
Higher-Order and Symbolic Computation 20(4): 403-429 (2007) |
| 2006 |
|---|
| 23 | EE | Oleg Kiselyov,
Chung-chieh Shan,
Amr Sabry:
Delimited dynamic binding.
ICFP 2006: 26-37 |
| 2005 |
|---|
| 22 | EE | Oleg Kiselyov,
Chung-chieh Shan,
Daniel P. Friedman,
Amr Sabry:
Backtracking, interleaving, and terminating monad transformers: (functional pearl).
ICFP 2005: 192-203 |
| 21 | EE | Juliana K. Vizzotto,
Thorsten Altenkirch,
Amr Sabry:
Structuring quantum effects: superoperators as arrows
CoRR abs/quant-ph/0501151: (2005) |
| 2004 |
|---|
| 20 | EE | Zena M. Ariola,
Hugo Herbelin,
Amr Sabry:
A type-theoretic foundation of continuations and prompts.
ICFP 2004: 40-53 |
| 2002 |
|---|
| 19 | | Olivier Danvy,
Amr Sabry:
Editorial.
Higher-Order and Symbolic Computation 15(2-3): 139-140 (2002) |
| 18 | EE | Daniel P. Friedman,
Amr Sabry:
CPS in little pieces: composing partial continuations.
J. Funct. Program. 12(6): 617-622 (2002) |
| 2001 |
|---|
| 17 | | Steven E. Ganz,
Amr Sabry,
Walid Taha:
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML.
ICFP 2001: 74-85 |
| 16 | | Yong Xiao,
Amr Sabry,
Zena M. Ariola:
From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition.
Higher-Order and Symbolic Computation 14(4): 387-409 (2001) |
| 15 | | Eugenio Moggi,
Amr Sabry:
Monadic encapsulation of effects: a revised approach (extended version).
J. Funct. Program. 11(6): 591-627 (2001) |
| 1999 |
|---|
| 14 | EE | Miley Semmelroth,
Amr Sabry:
Monadic Encapsulation in ML.
ICFP 1999: 8-17 |
| 13 | EE | John Howard Eli Fiskio-Lasseter,
Amr Sabry:
Putting Operational Techniques to the Test: A Syntactic Theory for Behavioral Verilog.
Electr. Notes Theor. Comput. Sci. 26: (1999) |
| 1998 |
|---|
| 12 | EE | Zena M. Ariola,
Amr Sabry:
Correctness of Monadic State: An Imperative Call-by-Need Calculus.
POPL 1998: 62-74 |
| 11 | | Amr Sabry:
What is a Purely Functional Language?
J. Funct. Program. 8(1): 1-22 (1998) |
| 1997 |
|---|
| 10 | | John Launchbury,
Amr Sabry:
Monadic State: Axiomatization and Type Safety.
ICFP 1997: 227-238 |
| 9 | EE | Amr Sabry,
Philip Wadler:
A Reflection on Call-by-Value.
ACM Trans. Program. Lang. Syst. 19(6): 916-941 (1997) |
| 8 | EE | Zena M. Ariola,
Amr Sabry:
Correctness of Monadic State: An Imperative Call-by-Need Calculus.
Electr. Notes Theor. Comput. Sci. 10: (1997) |
| 1996 |
|---|
| 7 | | Amr Sabry,
Philip Wadler:
A Reflection on Call-by-Value.
ICFP 1996: 13-24 |
| 6 | EE | John Hughes,
Lars Pareto,
Amr Sabry:
Proving the Correctness of Reactive Systems Using Sized Types.
POPL 1996: 410-423 |
| 1994 |
|---|
| 5 | | Amr Sabry,
Matthias Felleisen:
Is Continuation-Passing Useful for Data Flow Analysis?
PLDI 1994: 1-12 |
| 1993 |
|---|
| 4 | EE | Cormac Flanagan,
Amr Sabry,
Bruce F. Duba,
Matthias Felleisen:
The essence of compiling with continuations (with retrospective)
Best of PLDI 1993: 502-514 |
| 3 | | Cormac Flanagan,
Amr Sabry,
Bruce F. Duba,
Matthias Felleisen:
The Essence of Compiling with Continuations.
PLDI 1993: 237-247 |
| 2 | | Amr Sabry,
Matthias Felleisen:
Reasoning about Programs in Continuation-Passing Style.
Lisp and Symbolic Computation 6(3-4): 289-360 (1993) |
| 1992 |
|---|
| 1 | EE | Amr Sabry,
Matthias Felleisen:
Reasoning About Programs in Continuation-Passing Style.
LISP and Functional Programming 1992: 288-298 |
