Amr Sabry - McMaster Experts

Affiliations

Faculty of Engineering, McMaster University
Adjunct Lecturer, Computing and Software, Faculty of Engineering

Scholarly Activity in McMaster Experts

Co-author Network

Scholarly Activity
Research
Teaching
Contact
View All

selected scholarly activity

chapters
- Compositional Reversible Computation. Lecture Notes in Computer Science. 10-27. 2024
- Quantum Algorithms for the Study of Electronic Structure and Molecular Dynamics: Novel Computational Protocols. 228-251. 2024
- Quantum Algorithms for the Study of Electronic Structure and Molecular Dynamics: Novel Computational Protocols. V1-228-V1-251. 2023
- Embracing the laws of physics: Three reversible models of computation. Advances in Computers. 15-63. 2022
- Side Effects. 2534-2543.
conferences
- Symbolic Execution of Hadamard-Toffoli Quantum Circuits. Proceedings of the 2023 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation. 14-26. 2023
- NANOPI. Proceedings of the ACM Conference on Computer and Communications Security. 862-879. 2018
- A Library of Reversible Circuit Transformations (Work in Progress). Lecture Notes in Computer Science. 339-345. 2018
- From Symmetric Pattern-Matching to Quantum Control. Lecture Notes in Computer Science. 348-364. 2018
- Embracing the laws of Physics in the foundations of computation. 2017 6TH MEDITERRANEAN CONFERENCE ON EMBEDDED COMPUTING (MECO). 1-1. 2017
- Embracing the laws of Physics in the Foundations of Computation. 2017 6TH MEDITERRANEAN CONFERENCE ON EMBEDDED COMPUTING (MECO). 4-4. 2017
- Computing with Semirings and Weak Rig Groupoids. Lecture Notes in Computer Science. 123-148. 2016
- Expressing contract monitors as patterns of communication. ACM SIGPLAN Notices. 387-399. 2015
- Extensible effects. ACM SIGPLAN Notices. 59-70. 2013
- Encoding secure information flow with restricted delegation and revocation in Haskell. Proceedings of the 1st annual workshop on Functional programming concepts in domain-specific languages. 11-18. 2013
- Isomorphic Interpreters from Logically Reversible Abstract Machines. Lecture Notes in Computer Science. 57-71. 2013
- Information effects. Conference Record of the Annual ACM Symposium on Principles of Programming Languages. 73-84. 2012
- Information effects. ACM SIGPLAN Notices. 73-84. 2012
- Lazy v. Yield: Incremental, Linear Pretty-Printing. Lecture Notes in Computer Science. 190-206. 2012
- Lazy evaluation and delimited control. ACM SIGPLAN Notices. 153-164. 2009
- Lazy evaluation and delimited control. Conference Record of the Annual ACM Symposium on Principles of Programming Languages. 153-164. 2009
- Reasoning about General Quantum Programs over Mixed States. Lecture Notes in Computer Science. 321-335. 2009
- Delimited dynamic binding. Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming. 26-37. 2006
- Backtracking, interleaving, and terminating monad transformers. Proceedings of the tenth ACM SIGPLAN international conference on Functional programming. 192-203. 2005
- An abstract monadic semantics for value recursion. RAIRO - Theoretical Informatics and Applications. 375-400. 2004
- A type-theoretic foundation of continuations and prompts. ACM SIGPLAN Notices. 40-53. 2004
- A type-theoretic foundation of continuations and prompts. Proceedings of the ninth ACM SIGPLAN international conference on Functional programming. 40-53. 2004
- The essence of compiling with continuations. ACM SIGPLAN Notices. 504-514. 2004
- The essence of compiling with continuations. ACM SIGPLAN Notices. 502-514. 2004
- Modeling quantum computing in Haskell. Proceedings of the 2003 ACM SIGPLAN workshop on Haskell. 39-49. 2003
- Macros as multi-stage computations. Proceedings of the sixth ACM SIGPLAN international conference on Functional programming. 74-85. 2001
- Macros as multi-stage computations: Type-safe, generative, binding macros in MacroML. ACM SIGPLAN Notices. 74-85. 2001
- Monadic encapsulation in ML. ACM SIGPLAN Notices. 8-17. 1999
- Putting Operational Techniques to the Test: A Syntactic Theory for Behavioral Verilog. Electronic Notes in Theoretical Computer Science. 34-51. 1999
- Correctness of Monadic State: An Imperative Call-by-Need Calculus. Electronic Notes in Theoretical Computer Science. 53-53. 1998
- Correctness of monadic state. Conference Record of the Annual ACM Symposium on Principles of Programming Languages. 62-74. 1998
- A reflection on call-by-value. ACM Transactions on Programming Languages and Systems. 916-941. 1997
- Monadic state. ACM SIGPLAN Notices. 227-238. 1997
- Monadic state. ACM SIGPLAN Notices. 227-238. 1997
- A reflection on call-by-value. ACM SIGPLAN Notices. 13-24. 1996
- A reflection on call-by-value. Proceedings of the first ACM SIGPLAN international conference on Functional programming. 13-24. 1996
- Proving the correctness of reactive systems using sized types. Conference Record of the Annual ACM Symposium on Principles of Programming Languages. 410-423. 1996
- Is continuation-passing useful for data flow analysis?. ACM SIGPLAN Notices. 1-7. 1994
- The essence of compiling with continuations. ACM SIGPLAN Notices. 237-247. 1993
- Reasoning about programs in continuation-passing style.. Proceedings of the 1992 ACM conference on LISP and functional programming. 288-298. 1992
journal articles
- How to Bake a Quantum Π. Proceedings of the ACM on Programming Languages. 8:1-29. 2024
- With a Few Square Roots, Quantum Computing Is as Easy as Pi. Proceedings of the ACM on Programming Languages. 8:546-574. 2024
- Synthesis of Hidden Subgroup Quantum Algorithms and Quantum Chemical Dynamics. Journal of Chemical Theory and Computation. 19:6082-6092. 2023
- Quantum Computation of Hydrogen Bond Dynamics and Vibrational Spectra. Journal of Physical Chemistry Letters. 14:7256-7263. 2023
- The Quantum Effect: A Recipe for QuantumPi 2023
- Retrodictive Quantum Computing 2022
- Symmetries in reversible programming: from symmetric rig groupoids to reversible programming languages. Proceedings of the ACM on Programming Languages. 6:1-32. 2022
- Embracing the laws of physics: Three reversible models of computation. Advances in Computers. 126:15-63. 2022
- Mapping Quantum Chemical Dynamics Problems to Spin-Lattice Simulators. Journal of Chemical Theory and Computation. 17:6713-6732. 2021
- Not by equations alone: Reasoning with extensible effects. Journal of Functional Programming. 31. 2021
- A computational interpretation of compact closed categories: reversible programming with negative and fractional types. Proceedings of the ACM on Programming Languages. 5:1-29. 2021
- Fractional Types. Lecture Notes in Computer Science. 12227:169-186. 2020
- Quantum interval-valued probability: Contextuality and the Born rule. Physical Review A (PRA). 97. 2018
- From Symmetric Pattern-Matching to Quantum Control (Extended Version) 2018
- From Reversible Programs to Univalent Universes and Back. Electronic Notes in Theoretical Computer Science. 336:5-25. 2018
- An extended account of contract monitoring strategies as patterns of communication. Journal of Functional Programming. 28. 2018
- Corrigendum: Geometry of discrete quantum computing. Journal of Physics A: Mathematical and Theoretical. 49:039501-039501. 2016
- Reversible Communicating Processes. Electronic Proceedings in Theoretical Computer Science. 203:45-59. 2016
- Expressing contract monitors as patterns of communication. ACM SIGPLAN Notices. 50:387-399. 2015
- Discrete quantum theories. Journal of Physics A: Mathematical and Theoretical. 47:115305-115305. 2014
- Extensible effects. ACM SIGPLAN Notices. 48:59-70. 2014
- Extensible effects: An alternative to monad transformers. ACM SIGPLAN Notices. 48:59-70. 2014
- Geometry of discrete quantum computing. Journal of Physics A: Mathematical and Theoretical. 46:185301-185301. 2013
- The Power of Discrete Quantum Theories 2011
- Solving UNIQUE-SAT in a Modal Quantum Theory 2011
- Quantum Computing over Finite Fields 2011
- Lazy Evaluation and Delimited Control. Logical Methods in Computer Science. Volume 6, Issue 3. 2010
- A type-theoretic foundation of delimited continuations. LISP and Symbolic Computation. 22:233-273. 2009
- Sequent calculi and abstract machines. ACM Transactions on Programming Languages and Systems. 31:1-48. 2009
- The Arrow Calculus as a Quantum Programming Language. Lecture Notes in Computer Science. 5514:379-393. 2009
- Quantum Arrows in Haskell. Electronic Notes in Theoretical Computer Science. 210:139-152. 2008
- A proof-theoretic foundation of abortive continuations. LISP and Symbolic Computation. 20:403-429. 2007
- A monadic framework for delimited continuations. Journal of Functional Programming. 17:687-730. 2007
- An Algebra of Pure Quantum Programming. Electronic Notes in Theoretical Computer Science. 170:23-47. 2007
- Delimited dynamic binding. ACM SIGPLAN Notices. 41:26-37. 2006
- Structuring quantum effects: superoperators as arrows. Mathematical Structures in Computer Science. 16:453-468. 2006
- Backtracking, interleaving, and terminating monad transformers. ACM SIGPLAN Notices. 40:192-203. 2005
- CPS in little pieces: composing partial continuations. Journal of Functional Programming. 12:617-622. 2002
- Higher-Order and Symbolic Computation: Editorial. LISP and Symbolic Computation. 15:139-140. 2002
- Monadic encapsulation of effects: a revised approach (extended version). Journal of Functional Programming. 11:591-627. 2001
- Macros as multi-stage computations. ACM SIGPLAN Notices. 36:74-85. 2001
- From syntactic theories to interpreters: Automating the proof of unique decomposition. LISP and Symbolic Computation. 14:387-409. 2001
- Monadic encapsulation in ML. ACM SIGPLAN Notices. 34:8-17. 1999
- What is a purely functional language?. Journal of Functional Programming. 8:1-22. 1998
- Is continuation-passing useful for data flow analysis?. ACM SIGPLAN Notices. 29:1-12. 1994
- Reasoning about programs in continuation-passing style. LISP and Symbolic Computation. 6:289-360. 1993
- The essence of compiling with continuations. ACM SIGPLAN Notices. 28:237-247. 1993
- Reasoning about programs in continuation-passing style.. ACM SIGPLAN Lisp Pointers. V:288-298. 1992
preprints