Amr Sabry

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 26

Top Venues

CoRR

Proc. ACM Program. Lang.

J. Funct. Program.

University of Houston, TX, USA (PHD)

Education History

University of Houston, TX, USA

PHD

Publications

Jacques Carette, Chris Heunen, Robin Kaarsgaard, Amr Sabry
With a Few Square Roots, Quantum Computing Is as Easy as Pi. Proc. ACM Program. Lang. 8 (POPL) (2024)
Jacques Carette, Chris Heunen, Robin Kaarsgaard, Amr Sabry
Compositional Reversible Computation. RC (2024)
Jacques Carette, Chris Heunen, Robin Kaarsgaard, Amr Sabry
Compositional Reversible Computation. CoRR (2024)
Jacques Carette, Gerardo Ortiz, Amr Sabry
Symbolic Execution of Hadamard-Toffoli Quantum Circuits. PEPM@POPL (2023)
Jacques Carette, Chris Heunen, Robin Kaarsgaard, Amr Sabry
The Quantum Effect: A Recipe for QuantumPi. CoRR (2023)
Jacques Carette, Chris Heunen, Robin Kaarsgaard, Amr Sabry
With a Few Square Roots, Quantum Computing is as Easy as Π. CoRR (2023)
Vikraman Choudhury, Jacek Karwowski, Amr Sabry
Symmetries in reversible programming: from symmetric rig groupoids to reversible programming languages. Proc. ACM Program. Lang. 6 (POPL) (2022)
Jacques Carette, Roshan P. James, Amr Sabry
Chapter Two - Embracing the laws of physics: Three reversible models of computation. Adv. Comput. 126 (2022)
Jacques Carette, Gerardo Ortiz, Amr Sabry
Retrodictive Quantum Computing. CoRR (2022)
Oleg Kiselyov, Shin-Cheng Mu, Amr Sabry
Not by equations alone: Reasoning with extensible effects. J. Funct. Program. 31 (2021)
Chao-Hong Chen, Amr Sabry
A computational interpretation of compact closed categories: reversible programming with negative and fractional types. Proc. ACM Program. Lang. 5 (POPL) (2021)
Vikraman Choudhury, Jacek Karwowski, Amr Sabry
Symmetries in Reversible Programming: From Symmetric Rig Groupoids to Reversible Programming Languages. CoRR (2021)
Chao-Hong Chen, Vikraman Choudhury, Jacques Carette, Amr Sabry
Fractional Types - Expressive and Safe Space Management for Ancilla Bits. RC (2020)
Chao-Hong Chen, Vikraman Choudhury, Jacques Carette, Amr Sabry
Fractional Types: Expressive and Safe Space Management for Ancilla Bits. CoRR (2020)
Ruiyu Zhu, Darion Cassel, Amr Sabry, Yan Huang
NANOPI: Extreme-Scale Actively-Secure Multi-Party Computation. CCS (2018)
Jacques Carette, Chao-Hong Chen, Vikraman Choudhury, Amr Sabry
From Reversible Programs to Univalent Universes and Back. MFPS (2018)
Cameron Swords, Amr Sabry, Sam Tobin-Hochstadt
An extended account of contract monitoring strategies as patterns of communication. J. Funct. Program. 28 (2018)
Jacques Carette, Roshan P. James, Amr Sabry
Embracing the Laws of Physics: Three Reversible Models of Computation. CoRR (2018)
Amr Sabry, Benoît Valiron, Juliana Kaizer Vizzotto
From Symmetric Pattern-Matching to Quantum Control (Extended Version). CoRR (2018)
Amr Sabry, Benoît Valiron, Juliana Kaizer Vizzotto
From Symmetric Pattern-Matching to Quantum Control. FoSSaCS (2018)
Christian Hutslar, Jacques Carette, Amr Sabry
A Library of Reversible Circuit Transformations (Work in Progress). RC (2018)
Amr Sabry
Embracing the laws of Physics in the foundations of computation. MECO (2017)
Jacques Carette, Chao-Hong Chen, Vikraman Choudhury, Amr Sabry
From Reversible Programs to Univalent Universes and Back. CoRR (2017)
Jacques Carette, Amr Sabry
Computing with Semirings and Weak Rig Groupoids. ESOP (2016)
Cameron Swords, Amr Sabry, Sam Tobin-Hochstadt
Expressing contract monitors as patterns of communication. ICFP (2015)
Geoffrey Brown, Amr Sabry
Reversible Communicating Processes. PLACES (2015)
Doaa Hassan, Amr Sabry
Encoding secure information flow with restricted delegation and revocation in Haskell. FPCDSL@ICFP (2013)
Oleg Kiselyov, Amr Sabry, Cameron Swords
Extensible effects: an alternative to monad transformers. Haskell (2013)
Roshan P. James, Amr Sabry
Information effects. POPL (2012)
Roshan P. James, Amr Sabry
Isomorphic Interpreters from Logically Reversible Abstract Machines. RC (2012)
Oleg Kiselyov, Simon L. Peyton Jones, Amr Sabry
Lazy v. Yield: Incremental, Linear Pretty-Printing. APLAS (2012)
Ronald Garcia, Andrew Lumsdaine, Amr Sabry
Lazy Evaluation and Delimited Control Log. Methods Comput. Sci. 6 (3) (2010)
Juliana Kaizer Vizzotto, André Rauber Du Bois, Amr Sabry
The Arrow Calculus as a Quantum Programming Language. WoLLIC (2009)
Zena M. Ariola, Aaron Bohannon, Amr Sabry
Sequent calculi and abstract machines. ACM Trans. Program. Lang. Syst. 31 (4) (2009)
Ronald Garcia, Andrew Lumsdaine, Amr Sabry
Lazy evaluation and delimited control. POPL (2009)
Zena M. Ariola, Hugo Herbelin, Amr Sabry
A type-theoretic foundation of delimited continuations. High. Order Symb. Comput. 22 (3) (2009)
Juliana Kaizer Vizzotto, Giovani Rubert Librelotto, Amr Sabry
Reasoning about General Quantum Programs over Mixed States. SBMF (2009)
Juliana Kaizer Vizzotto, Antônio Carlos da Rocha Costa, Amr Sabry
Quantum Arrows in Haskell. Electron. Notes Theor. Comput. Sci. 210 (2008)
Zena M. Ariola, Hugo Herbelin, Amr Sabry
A proof-theoretic foundation of abortive continuations. High. Order Symb. Comput. 20 (4) (2007)
R. Kent Dybvig, Simon L. Peyton Jones, Amr Sabry
A monadic framework for delimited continuations. J. Funct. Program. 17 (6) (2007)
Thorsten Altenkirch, Jonathan Grattage, Juliana Kaizer Vizzotto, Amr Sabry
An Algebra of Pure Quantum Programming. Electron. Notes Theor. Comput. Sci. 170 (2007)
Oleg Kiselyov, Chung-chieh Shan, Amr Sabry
Delimited dynamic binding. ICFP (2006)
Juliana Kaizer Vizzotto, Thorsten Altenkirch, Amr Sabry
Structuring quantum effects: superoperators as arrows. Math. Struct. Comput. Sci. 16 (3) (2006)
Juliana Kaizer Vizzotto, Thorsten Altenkirch, Amr Sabry
Structuring quantum effects: superoperators as arrows CoRR (2005)
Oleg Kiselyov, Chung-chieh Shan, Daniel P. Friedman, Amr Sabry
Backtracking, interleaving, and terminating monad transformers: (functional pearl). ICFP (2005)
Eugenio Moggi, Amr Sabry
An abstract monadic semantics for value recursion. RAIRO Theor. Informatics Appl. 38 (4) (2004)
Zena M. Ariola, Hugo Herbelin, Amr Sabry
A type-theoretic foundation of continuations and prompts. ICFP (2004)
Amr Sabry
Modeling quantum computing in Haskell. Haskell (2003)
Eugenio Moggi, Amr Sabry
An Abstract Monadic Semantics for Value Recursion. FICS (2003)
Daniel P. Friedman, Amr Sabry
CPS in little pieces: composing partial continuations. J. Funct. Program. 12 (6) (2002)
Olivier Danvy, Amr Sabry
Editorial. High. Order Symb. Comput. 15 (2-3) (2002)
Yong Xiao, Amr Sabry, Zena M. Ariola
From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition. High. Order Symb. Comput. 14 (4) (2001)
Eugenio Moggi, Amr Sabry
Monadic encapsulation of effects: a revised approach (extended version). J. Funct. Program. 11 (6) (2001)
Steven E. Ganz, Amr Sabry, Walid Taha
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML. ICFP (2001)
Miley Semmelroth, Amr Sabry
Monadic Encapsulation in ML. ICFP (1999)
John Howard Eli Fiskio-Lasseter, Amr Sabry
Putting Operational Techniques to the Test: A Syntactic Theory for Behavioral Verilog. Electron. Notes Theor. Comput. Sci. 26 (1999)
Zena M. Ariola, Amr Sabry
Correctness of Monadic State: An Imperative Call-by-Need Calculus. POPL (1998)
Amr Sabry
What is a Purely Functional Language? J. Funct. Program. 8 (1) (1998)
John Launchbury, Amr Sabry
Monadic State: Axiomatization and Type Safety. ICFP (1997)
Zena M. Ariola, Amr Sabry
Correctness of Monadic State: An Imperative Call-by-Need Calculus. Electron. Notes Theor. Comput. Sci. 10 (1997)
Amr Sabry, Philip Wadler
A Reflection on Call-by-Value. ACM Trans. Program. Lang. Syst. 19 (6) (1997)
Amr Sabry, Philip Wadler
A Reflection on Call-by-Value. ICFP (1996)
John Hughes, Lars Pareto, Amr Sabry
Proving the Correctness of Reactive Systems Using Sized Types. POPL (1996)
Amr Sabry, Matthias Felleisen
Is Continuation-Passing Useful for Data Flow Analysis? PLDI (1994)
Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen
The essence of compiling with continuations (with retrospective) Best of PLDI (1993)
Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen
The Essence of Compiling with Continuations. PLDI (1993)
Amr Sabry, Matthias Felleisen
Reasoning about Programs in Continuation-Passing Style. LISP Symb. Comput. 6 (3-4) (1993)
Amr Sabry, Matthias Felleisen
Reasoning About Programs in Continuation-Passing Style. LISP and Functional Programming (1992)

Amr Sabry.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Amr Sabry