| 2025 | QCE | A Formalization of Measurement-Commuting Unitaries. | Ulrik de Muelenaere, Sinan Pehlivanoglu, Amr Sabry, Peter M. Kogge |
| 2024 | RC | Compositional Reversible Computation. | Jacques Carette, Chris Heunen, Robin Kaarsgaard, Amr Sabry |
| 2024 | SYNASC | Learning Spectral Properties of Boolean Functions: A Unifying Theme in Quantum Algorithms. | Mohsen Heidari, Amr Sabry |
| 2023 | PEPM | Symbolic Execution of Hadamard-Toffoli Quantum Circuits. | Jacques Carette, Gerardo Ortiz, Amr Sabry |
| 2020 | RC | Fractional Types - Expressive and Safe Space Management for Ancilla Bits. | Chao-Hong Chen, Vikraman Choudhury, Jacques Carette, Amr Sabry |
| 2018 | CCS | NANOPI: Extreme-Scale Actively-Secure Multi-Party Computation. | Ruiyu Zhu, Darion Cassel, Amr Sabry, Yan Huang |
| 2018 | FOSSACS | From Symmetric Pattern-Matching to Quantum Control. | Amr Sabry, Benot Valiron, Juliana Kaizer Vizzotto |
| 2018 | RC | A Library of Reversible Circuit Transformations (Work in Progress). | Christian Hutslar, Jacques Carette, Amr Sabry |
| 2016 | ESOP | Computing with Semirings and Weak Rig Groupoids. | Jacques Carette, Amr Sabry |
| 2015 | ICFP | Expressing contract monitors as patterns of communication. | Cameron Swords, Amr Sabry, Sam Tobin-Hochstadt |
| 2013 | HASKELL | Extensible effects: an alternative to monad transformers. | Oleg Kiselyov, Amr Sabry, Cameron Swords |
| 2013 | ICFP | Encoding secure information flow with restricted delegation and revocation in Haskell. | Doaa Hassan, Amr Sabry |
| 2012 | APLAS | Lazy v. Yield: Incremental, Linear Pretty-Printing. | Oleg Kiselyov, Simon L. Peyton Jones, Amr Sabry |
| 2012 | POPL | Information effects. | Roshan P. James, Amr Sabry |
| 2012 | RC | Isomorphic Interpreters from Logically Reversible Abstract Machines. | Roshan P. James, Amr Sabry |
| 2009 | POPL | Lazy evaluation and delimited control. | Ronald Garcia, Andrew Lumsdaine, Amr Sabry |
| 2009 | WoLLIC | The Arrow Calculus as a Quantum Programming Language. | Juliana Kaizer Vizzotto, Andr Rauber Du Bois, Amr Sabry |
| 2006 | ICFP | Delimited dynamic binding. | Oleg Kiselyov, Chung-chieh Shan, Amr Sabry |
| 2005 | ICFP | Backtracking, interleaving, and terminating monad transformers: (functional pearl). | Oleg Kiselyov, Chung-chieh Shan, Daniel P. Friedman, Amr Sabry |
| 2004 | ICFP | A type-theoretic foundation of continuations and prompts. | Zena M. Ariola, Hugo Herbelin, Amr Sabry |
| 2003 | HASKELL | Modeling quantum computing in Haskell. | Amr Sabry |
| 2001 | ICFP | Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML. | Steven E. Ganz, Amr Sabry, Walid Taha |
| 1999 | ICFP | Monadic Encapsulation in ML. | Miley Semmelroth, Amr Sabry |
| 1998 | POPL | Correctness of Monadic State: An Imperative Call-by-Need Calculus. | Zena M. Ariola, Amr Sabry |
| 1997 | ICFP | Monadic State: Axiomatization and Type Safety. | John Launchbury, Amr Sabry |
| 1996 | ICFP | A Reflection on Call-by-Value. | Amr Sabry, Philip Wadler |
| 1996 | POPL | Proving the Correctness of Reactive Systems Using Sized Types. | John Hughes, Lars Pareto, Amr Sabry |
| 1994 | PLDI | Is Continuation-Passing Useful for Data Flow Analysis? | Amr Sabry, Matthias Felleisen |
| 1993 | PLDI | The Essence of Compiling with Continuations. | Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen |
| 1993 | PLDI | The essence of compiling with continuations (with retrospective) | Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen |