The Essence of Compiling with Continuations. - Cormac Flanagan; Amr Sabry; Bruce F. Duba; Matthias Felleisen (PLDI, 1993)

The essence of compiling with continuations (with retrospective) - Cormac Flanagan; Amr Sabry; Bruce F. Duba; Matthias Felleisen (Best of PLDI, 1993)

Reasoning about Programs in Continuation-Passing Style. - Amr Sabry; Matthias Felleisen (LISP Symb. Comput., 1993)

The formal relationship between direct and continuation-passing style optimizing compilers - a synthesis of two paradigms. - Amr Sabry (1994)

Is Continuation-Passing Useful for Data Flow Analysis? - Amr Sabry; Matthias Felleisen (PLDI, 1994)

Proving the Correctness of Reactive Systems Using Sized Types. - John Hughes 001; Lars Pareto; Amr Sabry (POPL, 1996)

Monadic State: Axiomatization and Type Safety. - John Launchbury; Amr Sabry (ICFP, 1997)

Correctness of Monadic State: An Imperative Call-by-Need Calculus. - Zena M. Ariola; Amr Sabry (HOOTS, 1997)

A Reflection on Call-by-Value. - Amr Sabry; Philip Wadler (ACM Trans. Program. Lang. Syst., 1997)

What is a Purely Functional Language? - Amr Sabry (J. Funct. Program., 1998)

Monadic Encapsulation in ML. - Miley Semmelroth; Amr Sabry (ICFP, 1999)

Putting Operational Techniques to the Test: A Syntactic Theory for Behavioral Verilog. - John Howard Eli Fiskio-Lasseter; Amr Sabry (HOOTS, 1999)

Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML. - Steven E. Ganz; Amr Sabry; Walid Taha (ICFP, 2001)

Monadic encapsulation of effects: a revised approach (extended version). - Eugenio Moggi; Amr Sabry (J. Funct. Program., 2001)

From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition. - Yong Xiao; Amr Sabry; Zena M. Ariola (High. Order Symb. Comput., 2001)

CPS in little pieces: composing partial continuations. - Daniel P. Friedman; Amr Sabry (J. Funct. Program., 2002)

Editorial. - Olivier Danvy; Amr Sabry (High. Order Symb. Comput., 2002)

Modeling quantum computing in Haskell. - Amr Sabry (Haskell, 2003)

A type-theoretic foundation of continuations and prompts. - Zena M. Ariola; Hugo Herbelin; Amr Sabry (ICFP, 2004)

An abstract monadic semantics for value recursion. - Eugenio Moggi; Amr Sabry (RAIRO Theor. Informatics Appl., 2004)

Backtracking, interleaving, and terminating monad transformers: (functional pearl). - Oleg Kiselyov; Chung-chieh Shan; Daniel P. Friedman; Amr Sabry (ICFP, 2005)

An Algebra of Pure Quantum Programming. - Thorsten Altenkirch; Jonathan Grattage; Juliana Kaizer Vizzotto; Amr Sabry (QPL, 2005)

Delimited dynamic binding. - Oleg Kiselyov; Chung-chieh Shan; Amr Sabry (ICFP, 2006)

Quantum Arrows in Haskell. - Juliana Kaizer Vizzotto; Antônio Carlos da Rocha Costa; Amr Sabry (QPL, 2006)

Structuring quantum effects: superoperators as arrows. - Juliana Kaizer Vizzotto; Thorsten Altenkirch; Amr Sabry (Math. Struct. Comput. Sci., 2006)

A monadic framework for delimited continuations. - R. Kent Dybvig; Simon L. Peyton Jones; Amr Sabry (J. Funct. Program., 2007)

A proof-theoretic foundation of abortive continuations. - Zena M. Ariola; Hugo Herbelin; Amr Sabry (High. Order Symb. Comput., 2007)

Side Effects. - Amr Sabry (Wiley Encyclopedia of Computer Science and Engineering, 2008)

Reasoning about General Quantum Programs over Mixed States. - Juliana Kaizer Vizzotto; Giovani Rubert Librelotto; Amr Sabry (SBMF, 2009)

The Arrow Calculus as a Quantum Programming Language. - Juliana Kaizer Vizzotto; André Rauber Du Bois; Amr Sabry (WoLLIC, 2009)

A type-theoretic foundation of delimited continuations. - Zena M. Ariola; Hugo Herbelin; Amr Sabry (High. Order Symb. Comput., 2009)

Sequent calculi and abstract machines. - Zena M. Ariola; Aaron Bohannon; Amr Sabry (ACM Trans. Program. Lang. Syst., 2009)

Lazy Evaluation and Delimited Control - Ronald Garcia; Andrew Lumsdaine; Amr Sabry (Log. Methods Comput. Sci., 2010)

Lazy v. Yield: Incremental, Linear Pretty-Printing. - Oleg Kiselyov; Simon L. Peyton Jones; Amr Sabry (APLAS, 2012)

Information effects. - Roshan P. James; Amr Sabry (POPL, 2012)

Isomorphic Interpreters from Logically Reversible Abstract Machines. - Roshan P. James; Amr Sabry (RC, 2012)

Extensible effects: an alternative to monad transformers. - Oleg Kiselyov; Amr Sabry; Cameron Swords (Haskell, 2013)

Encoding secure information flow with restricted delegation and revocation in Haskell. - Doaa Hassan; Amr Sabry (FPCDSL@ICFP, 2013)

Expressing contract monitors as patterns of communication. - Cameron Swords; Amr Sabry; Sam Tobin-Hochstadt (ICFP, 2015)

Reversible Communicating Processes. - Geoffrey Brown; Amr Sabry (PLACES, 2015)

Computing with Semirings and Weak Rig Groupoids. - Jacques Carette; Amr Sabry (ESOP, 2016)

Embracing the laws of Physics in the foundations of computation. - Amr Sabry (MECO, 2017)

NANOPI: Extreme-Scale Actively-Secure Multi-Party Computation. - Ruiyu Zhu; Darion Cassel; Amr Sabry; Yan Huang 001 (CCS, 2018)

From Symmetric Pattern-Matching to Quantum Control. - Amr Sabry; Benoît Valiron; Juliana Kaizer Vizzotto (FoSSaCS, 2018)

A Library of Reversible Circuit Transformations (Work in Progress). - Christian Hutslar; Jacques Carette; Amr Sabry (RC, 2018)

From Symmetric Pattern-Matching to Quantum Control (Extended Version). - Amr Sabry; Benoît Valiron; Juliana Kaizer Vizzotto (CoRR, 2018)

Embracing the Laws of Physics: Three Reversible Models of Computation. - Jacques Carette; Roshan P. James; Amr Sabry (CoRR, 2018)

From Reversible Programs to Univalent Universes and Back. - Jacques Carette; Chao-Hong Chen; Vikraman Choudhury; Amr Sabry (MFPS, 2018)

An extended account of contract monitoring strategies as patterns of communication. - Cameron Swords; Amr Sabry; Sam Tobin-Hochstadt (J. Funct. Program., 2018)

Fractional Types - Expressive and Safe Space Management for Ancilla Bits. - Chao-Hong Chen; Vikraman Choudhury; Jacques Carette; Amr Sabry (RC, 2020)

Not by equations alone: Reasoning with extensible effects. - Oleg Kiselyov; Shin-Cheng Mu; Amr Sabry (J. Funct. Program., 2021)

A computational interpretation of compact closed categories: reversible programming with negative and fractional types. - Chao-Hong Chen; Amr Sabry (Proc. ACM Program. Lang., 2021)

Chapter Two - Embracing the laws of physics: Three reversible models of computation. - Jacques Carette; Roshan P. James; Amr Sabry (Adv. Comput., 2022)

Retrodictive Quantum Computing. - Jacques Carette; Gerardo Ortiz; Amr Sabry (CoRR, 2022)

Symmetries in reversible programming: from symmetric rig groupoids to reversible programming languages. - Vikraman Choudhury; Jacek Karwowski; Amr Sabry (Proc. ACM Program. Lang., 2022)

Symbolic Execution of Hadamard-Toffoli Quantum Circuits. - Jacques Carette; Gerardo Ortiz; Amr Sabry (PEPM@POPL, 2023)

The Quantum Effect: A Recipe for QuantumPi. - Jacques Carette; Chris Heunen; Robin Kaarsgaard; Amr Sabry (CoRR, 2023)

With a Few Square Roots, Quantum Computing is as Easy as Π. - Jacques Carette; Chris Heunen; Robin Kaarsgaard; Amr Sabry (CoRR, 2023)

Compositional Reversible Computation. - Jacques Carette; Chris Heunen; Robin Kaarsgaard; Amr Sabry (RC, 2024)

Learning Spectral Properties of Boolean Functions: A Unifying Theme in Quantum Algorithms. - Mohsen Heidari; Amr Sabry (SYNASC, 2024)

Scheme Pearl: Quantum Continuations. - Vikraman Choudhury; Borislav Agapiev; Amr Sabry (CoRR, 2024)

How to Bake a Quantum Π. - Jacques Carette; Chris Heunen; Robin Kaarsgaard; Amr Sabry (Proc. ACM Program. Lang., 2024)

With a Few Square Roots, Quantum Computing Is as Easy as Pi. - Jacques Carette; Chris Heunen; Robin Kaarsgaard; Amr Sabry (Proc. ACM Program. Lang., 2024)