default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmr Sabry
Person information
- affiliation: Indiana University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]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): 546-574 (2024)- [c38]Jacques Carette, Chris Heunen, Robin Kaarsgaard, Amr Sabry:
Compositional Reversible Computation. RC 2024: 10-27 - [i11]Jacques Carette, Chris Heunen, Robin Kaarsgaard, Amr Sabry:
Compositional Reversible Computation. CoRR abs/2405.20842 (2024) - [i10]Vikraman Choudhury, Borislav Agapiev, Amr Sabry:
Scheme Pearl: Quantum Continuations. CoRR abs/2409.11106 (2024) - 2023
- [c37]Jacques Carette, Gerardo Ortiz, Amr Sabry:
Symbolic Execution of Hadamard-Toffoli Quantum Circuits. PEPM@POPL 2023: 14-26 - [i9]Jacques Carette, Chris Heunen, Robin Kaarsgaard, Amr Sabry:
The Quantum Effect: A Recipe for QuantumPi. CoRR abs/2302.01885 (2023) - [i8]Jacques Carette, Chris Heunen, Robin Kaarsgaard, Amr Sabry:
With a Few Square Roots, Quantum Computing is as Easy as Π. CoRR abs/2310.14056 (2023) - 2022
- [j19]Jacques Carette, Roshan P. James, Amr Sabry:
Chapter Two - Embracing the laws of physics: Three reversible models of computation. Adv. Comput. 126: 15-63 (2022) - [j18]Vikraman Choudhury, Jacek Karwowski, Amr Sabry:
Symmetries in reversible programming: from symmetric rig groupoids to reversible programming languages. Proc. ACM Program. Lang. 6(POPL): 1-32 (2022) - [i7]Jacques Carette, Gerardo Ortiz, Amr Sabry:
Retrodictive Quantum Computing. CoRR abs/2205.06346 (2022) - 2021
- [j17]Oleg Kiselyov, Shin-Cheng Mu, Amr Sabry:
Not by equations alone: Reasoning with extensible effects. J. Funct. Program. 31: e2 (2021) - [j16]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): 1-29 (2021) - [i6]Vikraman Choudhury, Jacek Karwowski, Amr Sabry:
Symmetries in Reversible Programming: From Symmetric Rig Groupoids to Reversible Programming Languages. CoRR abs/2110.05404 (2021) - 2020
- [c36]Chao-Hong Chen, Vikraman Choudhury, Jacques Carette, Amr Sabry:
Fractional Types - Expressive and Safe Space Management for Ancilla Bits. RC 2020: 169-186 - [i5]Chao-Hong Chen, Vikraman Choudhury, Jacques Carette, Amr Sabry:
Fractional Types: Expressive and Safe Space Management for Ancilla Bits. CoRR abs/2002.07020 (2020)
2010 – 2019
- 2018
- [j15]Cameron Swords, Amr Sabry, Sam Tobin-Hochstadt:
An extended account of contract monitoring strategies as patterns of communication. J. Funct. Program. 28: e4 (2018) - [c35]Ruiyu Zhu, Darion Cassel, Amr Sabry, Yan Huang:
NANOPI: Extreme-Scale Actively-Secure Multi-Party Computation. CCS 2018: 862-879 - [c34]Amr Sabry, Benoît Valiron, Juliana Kaizer Vizzotto:
From Symmetric Pattern-Matching to Quantum Control. FoSSaCS 2018: 348-364 - [c33]Christian Hutslar, Jacques Carette, Amr Sabry:
A Library of Reversible Circuit Transformations (Work in Progress). RC 2018: 339-345 - [c32]Jacques Carette, Chao-Hong Chen, Vikraman Choudhury, Amr Sabry:
From Reversible Programs to Univalent Universes and Back. MFPS 2018: 5-25 - [i4]Amr Sabry, Benoît Valiron, Juliana Kaizer Vizzotto:
From Symmetric Pattern-Matching to Quantum Control (Extended Version). CoRR abs/1804.00952 (2018) - [i3]Jacques Carette, Roshan P. James, Amr Sabry:
Embracing the Laws of Physics: Three Reversible Models of Computation. CoRR abs/1811.03678 (2018) - 2017
- [c31]Amr Sabry:
Embracing the laws of Physics in the foundations of computation. MECO 2017: 1 - [i2]Jacques Carette, Chao-Hong Chen, Vikraman Choudhury, Amr Sabry:
From Reversible Programs to Univalent Universes and Back. CoRR abs/1708.02710 (2017) - 2016
- [c30]Jacques Carette, Amr Sabry:
Computing with Semirings and Weak Rig Groupoids. ESOP 2016: 123-148 - 2015
- [c29]Cameron Swords, Amr Sabry, Sam Tobin-Hochstadt:
Expressing contract monitors as patterns of communication. ICFP 2015: 387-399 - [c28]Geoffrey Brown, Amr Sabry:
Reversible Communicating Processes. PLACES 2015: 45-59 - 2013
- [c27]Oleg Kiselyov, Amr Sabry, Cameron Swords:
Extensible effects: an alternative to monad transformers. Haskell 2013: 59-70 - [c26]Doaa Hassan, Amr Sabry:
Encoding secure information flow with restricted delegation and revocation in Haskell. FPCDSL@ICFP 2013: 11-18 - 2012
- [c25]Oleg Kiselyov, Simon L. Peyton Jones, Amr Sabry:
Lazy v. Yield: Incremental, Linear Pretty-Printing. APLAS 2012: 190-206 - [c24]Roshan P. James, Amr Sabry:
Information effects. POPL 2012: 73-84 - [c23]Roshan P. James, Amr Sabry:
Isomorphic Interpreters from Logically Reversible Abstract Machines. RC 2012: 57-71 - 2010
- [j14]Ronald Garcia, Andrew Lumsdaine, Amr Sabry:
Lazy Evaluation and Delimited Control. Log. Methods Comput. Sci. 6(3) (2010)
2000 – 2009
- 2009
- [j13]Zena M. Ariola, Hugo Herbelin, Amr Sabry:
A type-theoretic foundation of delimited continuations. High. Order Symb. Comput. 22(3): 233-273 (2009) - [j12]Zena M. Ariola, Aaron Bohannon, Amr Sabry:
Sequent calculi and abstract machines. ACM Trans. Program. Lang. Syst. 31(4): 13:1-13:48 (2009) - [c22]Ronald Garcia, Andrew Lumsdaine, Amr Sabry:
Lazy evaluation and delimited control. POPL 2009: 153-164 - [c21]Juliana Kaizer Vizzotto, Giovani Rubert Librelotto, Amr Sabry:
Reasoning about General Quantum Programs over Mixed States. SBMF 2009: 321-335 - [c20]Juliana Kaizer Vizzotto, André Rauber Du Bois, Amr Sabry:
The Arrow Calculus as a Quantum Programming Language. WoLLIC 2009: 379-393 - 2008
- [p1]Amr Sabry:
Side Effects. Wiley Encyclopedia of Computer Science and Engineering 2008 - 2007
- [j11]R. Kent Dybvig, Simon L. Peyton Jones, Amr Sabry:
A monadic framework for delimited continuations. J. Funct. Program. 17(6): 687-730 (2007) - [j10]Zena M. Ariola, Hugo Herbelin, Amr Sabry:
A proof-theoretic foundation of abortive continuations. High. Order Symb. Comput. 20(4): 403-429 (2007) - 2006
- [j9]Juliana Kaizer Vizzotto, Thorsten Altenkirch, Amr Sabry:
Structuring quantum effects: superoperators as arrows. Math. Struct. Comput. Sci. 16(3): 453-468 (2006) - [c19]Oleg Kiselyov, Chung-chieh Shan, Amr Sabry:
Delimited dynamic binding. ICFP 2006: 26-37 - [c18]Juliana Kaizer Vizzotto, Antônio Carlos da Rocha Costa, Amr Sabry:
Quantum Arrows in Haskell. QPL 2006: 139-152 - 2005
- [c17]Oleg Kiselyov, Chung-chieh Shan, Daniel P. Friedman, Amr Sabry:
Backtracking, interleaving, and terminating monad transformers: (functional pearl). ICFP 2005: 192-203 - [c16]Thorsten Altenkirch, Jonathan Grattage, Juliana Kaizer Vizzotto, Amr Sabry:
An Algebra of Pure Quantum Programming. QPL 2005: 23-47 - [i1]Juliana Kaizer Vizzotto, Thorsten Altenkirch, Amr Sabry:
Structuring quantum effects: superoperators as arrows. CoRR abs/quant-ph/0501151 (2005) - 2004
- [j8]Eugenio Moggi, Amr Sabry:
An abstract monadic semantics for value recursion. RAIRO Theor. Informatics Appl. 38(4): 375-400 (2004) - [c15]Zena M. Ariola, Hugo Herbelin, Amr Sabry:
A type-theoretic foundation of continuations and prompts. ICFP 2004: 40-53 - 2003
- [c14]Eugenio Moggi, Amr Sabry:
An Abstract Monadic Semantics for Value Recursion. FICS 2003: 64-79 - [c13]Amr Sabry:
Modeling quantum computing in Haskell. Haskell 2003: 39-49 - 2002
- [j7]Daniel P. Friedman, Amr Sabry:
CPS in little pieces: composing partial continuations. J. Funct. Program. 12(6): 617-622 (2002) - [j6]Olivier Danvy, Amr Sabry:
Editorial. High. Order Symb. Comput. 15(2-3): 139-140 (2002) - 2001
- [j5]Eugenio Moggi, Amr Sabry:
Monadic encapsulation of effects: a revised approach (extended version). J. Funct. Program. 11(6): 591-627 (2001) - [j4]Yong Xiao, Amr Sabry, Zena M. Ariola:
From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition. High. Order Symb. Comput. 14(4): 387-409 (2001) - [c12]Steven E. Ganz, Amr Sabry, Walid Taha:
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML. ICFP 2001: 74-85
1990 – 1999
- 1999
- [c11]Miley Semmelroth, Amr Sabry:
Monadic Encapsulation in ML. ICFP 1999: 8-17 - [c10]John Howard Eli Fiskio-Lasseter, Amr Sabry:
Putting Operational Techniques to the Test: A Syntactic Theory for Behavioral Verilog. HOOTS 1999: 34-51 - 1998
- [j3]Amr Sabry:
What is a Purely Functional Language? J. Funct. Program. 8(1): 1-22 (1998) - [c9]Zena M. Ariola, Amr Sabry:
Correctness of Monadic State: An Imperative Call-by-Need Calculus. POPL 1998: 62-74 - 1997
- [j2]Amr Sabry, Philip Wadler:
A Reflection on Call-by-Value. ACM Trans. Program. Lang. Syst. 19(6): 916-941 (1997) - [c8]John Launchbury, Amr Sabry:
Monadic State: Axiomatization and Type Safety. ICFP 1997: 227-238 - [c7]Zena M. Ariola, Amr Sabry:
Correctness of Monadic State: An Imperative Call-by-Need Calculus. HOOTS 1997: 53 - 1996
- [c6]Amr Sabry, Philip Wadler:
A Reflection on Call-by-Value. ICFP 1996: 13-24 - [c5]John Hughes, Lars Pareto, Amr Sabry:
Proving the Correctness of Reactive Systems Using Sized Types. POPL 1996: 410-423 - 1994
- [b1]Amr Sabry:
The formal relationship between direct and continuation-passing style optimizing compilers - a synthesis of two paradigms. University of Houston, TX, USA, Rice COMP TR 94-241, 1994 - [c4]Amr Sabry, Matthias Felleisen:
Is Continuation-Passing Useful for Data Flow Analysis? PLDI 1994: 1-12 - 1993
- [j1]Amr Sabry, Matthias Felleisen:
Reasoning about Programs in Continuation-Passing Style. LISP Symb. Comput. 6(3-4): 289-360 (1993) - [c3]Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen:
The Essence of Compiling with Continuations. PLDI 1993: 237-247 - [c2]Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen:
The essence of compiling with continuations (with retrospective). Best of PLDI 1993: 502-514 - 1992
- [c1]Amr Sabry, Matthias Felleisen:
Reasoning About Programs in Continuation-Passing Style. LISP and Functional Programming 1992: 288-298
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
