Amr Sabry

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