Research

Software

Research papers

The following copyright notice applies to papers published in ACM conferences and workshops.Copyright © by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or permissions ... acm org.

  1. Jacques Carette, Chris Heunen, Robin Kaarsgaard, and Amr Sabry, Compositional Reversible Computation. Invited paper. RC 2024
    PDF
  2. Jacques Carette, Chris Heunen, Robin Kaarsgaard, and Amr Sabry, With a Few Square Roots, Quantum Computing is as Easy as Pi. POPL 2024.
    PDF
  3. Iyengar, Srinivasan; Kumar, Anup; Saha, Debadrita; Sabry, Amr. A Synthesis of Hidden Subgroup Quantum Algorithms and Quantum Chemical Dynamics. Journal of Chemical Theory and Computation, 2023.
  4. Philip Richerme, Melissa C. Revelle, Christopher G. Yale, Daniel Lobser, Ashlyn D. Burch, Susan M. Clark, Debadrita Saha, Miguel Angel Lopez-Ruiz, Anurag Dwivedi, Jeremy M. Smith, Sam A. Norrell, Amr Sabry, and Srinivasan S. Iyengar. Quantum Computation of Hydrogen Bond Dynamics and Vibrational Spectra. J. Phys. Chem. Lett. 2023, 14, 7256−7263
  5. Jacques Carette, Chris Heunen, Robin Kaarsgaard, and Amr Sabry, The Quantum Effect: A Recipe for QuantumPi, 2023
    arXiv
  6. Jacques Carette, Gerardo Ortiz, and Amr Sabry, Symbolic Execution of Hadamard-Toffoli Quantum Circuits PEPM 2023
    ACM DL
    PDF
  7. Jacques Carette, Gerardo Ortiz, and Amr Sabry. Retrodictive Quantum Computing.
    arXiv
    GitHub repository
  8. Vikraman Choudhury, Jacek Karwowski, and Amr Sabry. Symmetries in Reversible Programming: From Symmetric Rig Groupoids to Reversible Programming Languages. POPL 2022
    PDF
  9. Debadrita Saha, Srinivasan S. Iyengar, Philip Richerme, Jeremy M. Smith, and Amr Sabry. Mapping Quantum Chemical Dynamics Problems to Spin-Lattice Simulators. J. Chem. Theory Comput. 2021, 17, 11, 6713–6732
  10. Chao-Hong Chen and Amr Sabry. A Computational Interpretation of Compact Closed Categories: Reversible Programming with Negative and Fractional Types. POPL 2021
    PDF
    Errata
  11. Chao-Hong Chen, Vikraman Choudhury, Jacques Carette, and Amr Sabry, Fractional Types: Expressive and Safe Management for Ancilla Bits. RC 2020.
  12. Oleg Kiselyov, Shin-Cheng Mu, and Amr Sabry, Not by Equations Alone: Reasoning with Extensible Effects., JFP 2020.
    PDF
  13. Jacques Carette, Roshan P. James, and Amr Sabry. Embracing the Laws of Physics: Three Reversible Models of Computation, 2018.
    Final version appears in Advances in Computers, Elsevier, 2022
  14. Ruiyu Zhu, Darion Cassel, Amr Sabry, and Yan Huang. nanoPi: Extreme-Scale Actively-Secure Multi-Party Computation: Resolving the space-round dilemma using lightweight program instrumentation, CCS 2018.
  15. Christian Hutslar, Jacques Carette, and Amr Sabry. A Library of Reversible Circuit Transformations. Work-in-progress report in the Conference on Reversible Computation, 2018.
    PDF
  16. Cameron Swords, Amr Sabry, and Sam Tobin-Hochstadt. An Extended Account of Contract Monitoring Strategies as Patterns of Communication. JFP, 2018.
    PDF
    Open access JFP version
  17. Amr Sabry, Benoît Valiron, and Juliana Kaizer Vizzotto, From Symmetric Pattern-Matching to Quantum Control, FoSSaCS 2018.
    PDF
    arXiv (extended version)
  18. Yu-Tsung Tai, Andrew J. Hanson, Gerardo Ortiz, and Amr Sabry, Quantum Interval-Valued Probability: Contextuality and the Born Rule, Physical Review A, Vol. 97. No. 5, 2018.
    Journal version (2018)
    arXiv entry (2017)
  19. Jacques Carette, Chao-Hong Chen, Vikraman Choudhury, Robert Rose, and Amr Sabry, From Reversible Programs to Univalent Universes and Back, Invited talk and paper, MFPS 2017.
    ENTCS version
  20. Amr Sabry, Embracing the Laws of Physics, Invited talk at MECO 2017.
  21. Hamidreza Bahramian, Narges Nematollahi, and Amr Sabry, Copredication in Homotopy Type Theory: A homotopical approach to formal semantics of natural languages. Fourth Workshop on Natural Language and Computer Science, NLCS ’16 .
  22. Jacques Carette and Amr Sabry, Computing with Semirings and Weak Rig Groupoids. In the European Symposium on Programming, ESOP 2016.
    PDF
  23. Cameron Swords, Amr Sabry, and Sam Tobin-Hochstadt. Contract Monitoring Semantics as Patterns of Communication. In the International Conference on Functional Programming, ICFP 2015.
    PDF
  24. Geoffrey Brown and Amr Sabry. Reversible Communicating Processes. In the Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, PLACES 2015.
    PDF
  25. Zachary Sparks and Amr Sabry. Superstructural Reversible Logic. In the 3rd International Workshop on Linearity, 2014.
    PDF
  26. Roshan P. James and Amr Sabry. Theseus: A High Level Language for Reversible Computing. Work-in-progress report in the Conference on Reversible Computation, 2014.
    PDF
  27. Andrew J. Hanson, Gerardo Ortiz, Amr Sabry, and Yu-Tsung Tai. Discrete Quantum Theories. In J. Phys. A: Math. Theor. 47 (2014) 115305.
    arXiv entry (2013)
    Slides (Colloquiumfest, University of Saskatchewan, Canada, 2014.)
    Slides (Workshop on Quantum Information and Foundations of Quantum Mechanics, University of British Columbia, Vancouver, Canada, 2013.)
  28. Oleg Kiselyov, Amr Sabry, and Cameron Swords. Extensible Effects: An Alternative to Monad Transformers. In the Haskell Symposium, 2013.
    PDF
  29. Doaa Hassan and Amr Sabry. Encoding Secure Information Flow with Restricted Delegation and Revocation in Haskell. In the Workshop on Functional Programming Concepts in Domain-Specific Languages, 2013.
    PDF
  30. Andrew J. Hanson, Gerardo Ortiz, Amr Sabry, and Yu-Tsung Tai. Geometry of Discrete Quantum Computing. J. Phys. A: Math. Theor. 46 (2013) 185301.
    arXiv entry (2012,2013)
    Journal version (2013)
    Corrigendum (2015)
    Cover of JPhysA Volume 46 Issue 18 with an image from the paper
  31. Oleg Kiselyov, Simon Peyton-Jones, and Amr Sabry. Lazy v. Yield: Incremental, Linear Pretty-printing. In the Asian Symposium on Programming Languages and Systems, APLAS 2012.
    PDF
    Clojure port by Brandon Bloom
  32. Roshan P. James and Amr Sabry. Isomorphic Interpreters from Logically Reversible Abstract Machines. In the Workshop on Reversible Computation, RC 2012.
    PDF
  33. Roshan P. James and Amr Sabry. Embracing the Laws of Physics. In the Off the Beaten Track workshop, OBT 2012.
    PDF
    PDF slides
  34. ACM DL Author-ize serviceInformation effects

    Roshan P. James, Amr Sabry
    ACM SIGPLAN Notices – POPL ’12, 2012
  35. Roshan P. James and Amr Sabry. Yield, the control operator: exploring session types. In the Continuation Workshop, CW 2011.
    PDF slides
  36. William J. Bowman, Roshan P. James, and Amr Sabry. Dagger Traced Symmetric Monoidal Categories and Reversible Programming. In the Workshop on Reversible Computation, RC 2011.
    PDF
    Code
  37. Andrew J. Hanson, Gerardo Ortiz, Amr Sabry, and Jeremiah Willcock. The Power of Discrete Quantum Theories, 2011.
    arXiv entry
  38. Roshan P. James, Gerardo Ortiz, and Amr Sabry. Quantum Computing over Finite Fields: Reversible Relational Programming with Exclusive Disjunctions, 2011.
    arXiv entry
  39. Roshan P. James and Amr Sabry. Yield: Mainstream Delimited Continuations. In the Workshop on the Theory and Practice of Delimited Continuations, TPDC 2011.
    PDF
    Code
  40. Jeremiah Willcock and Amr Sabry. Solving UNIQUE-SAT in a Modal Quantum Theory, 2011.
    arXiv entry
  41. Ronald Garcia, Andrew Lumsdaine, and Amr Sabry. Lazy Evaluation and Delimited Control. Logical Methods in Computer Science, Volume 6, Number 3, 2010.
  42. Juliana K. Vizzotto, Giovani Rubert Librelotto, and Amr Sabry. Reasoning about General Quantum Programs over Mixed States. In the Brazilian Symposium on Formal Methods, SBMF 2009.
  43. Juliana K. Vizzotto, André Rauber Du Bois, and Amr Sabry. The Arrow Calculus as a Quantum Programming Language. In the Workshop on Logic, Language, Information and Computation, 2009.
    arXiv entry
  44. ACM DL Author-ize serviceLazy evaluation and delimited control

    Ronald Garcia, Andrew Lumsdaine, Amr Sabry
    POPL ’09 Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, 2009
  45. Amr Sabry. Side Effects. In the Encyclopedia of Computer Science and Computer Engineering, 2008.
    PDF
  46. Larisse D. Voufo, Gerardo Ortiz, and Amr Sabry. Quantum Circuits: From a Network to a One-Way Model. In DCM-QPL, 2008.
    Tutorial version appears as Technical Report 665, Computer Science Department, Indiana University, 2008.
  47. Zena M. Ariola and Hugo Herbelin and Amr Sabry. A Type-Theoretic Foundation of Delimited Continuations. Higher Order and Symbolic Computation, ISSN 1388-3690 (Print) 1573-0557 (Online), October 2007.
    Postscript
    PDF
  48. Juliana K. Vizzotto, Antônio Carlos da Rocha Costa, and Amr Sabry. Structuring General and Complete Quantum Computations in Haskell: The Arrows Approach. In: XX CTD – Concurso de Teses e Dissertacoes da SBC, Rio de Janeiro, RS, Brazil, 2007.
  49. ACM DL Author-ize serviceSequent calculi and abstract machines

    Zena M. Ariola, Aaron Bohannon, Amr Sabry
    ACM Transactions on Programming Languages and Systems (TOPLAS), 2009

    Haskell code (tar file)

  50. Juliana K. Vizzotto, Antônio Carlos da Rocha Costa, and Amr Sabry. Quantum Arrows in Haskell. In the Workshop on Quantum Programming Languages, 2006. Final version in ENTCS.
    Postscript
  51. ACM DL Author-ize serviceDelimited dynamic binding

    Oleg Kiselyov, Chung-chieh Shan, Amr Sabry
    ICFP ’06 Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming, 2006
  52. R. Kent Dybvig, Simon Peyton-Jones, and Amr Sabry. A Monadic Framework for Delimited Continuations. J. Functional Programming, volume 17 , issue 6, pages 687-730, November 2007.
    Postscript
    PDF
    Tech. Rep. TR615, Computer Science Department, Indiana University, June 2005.
    Gzipped tar file with the code
  53. Juliana K. Vizzotto, Thorsten Altenkirch and Amr Sabry. Structuring Quantum Effects: Superoperators as Arrows. Mathematical Structures in Computer Science, 16(3), Jan. 2006.
    Postscript
    PDF
    arXiv entry
    Slides (Postscript, PDF)
  54. Thorsten Altenkirch, Jonathan Grattage, Juliana K. Vizzotto, and Amr Sabry. An Algebra of Pure Quantum Programming. In the Workshop on Quantum Programming Languages, 2005.
    Postscript
    PDF
    arXiv entry
    Final version in the Electronic Notes in Theoretical Computer Science, vol. 170, pp. 23-47, 2007:
    PDF
  55. ACM DL Author-ize serviceBacktracking, interleaving, and terminating monad transformers: (functional pearl)

    Oleg Kiselyov, Chung-chieh Shan, Daniel P. Friedman, Amr Sabry
    ICFP ’05 Proceedings of the tenth ACM SIGPLAN international conference on Functional programming, 2005
  56. Zena M. Ariola, Hugo Herbelin, and Amr Sabry. A Proof-Theoretic Foundation of Abortive Continuations. Higher-Order and Symbolic Computation, volume 20, number 4, pages 403-429, December 2007.
    Postscript
    PDF
    Extended version: Technical Report TR608, Computer Science Department, Indiana University, 2005. (Postscript, PDF)
  57. Aaron Bohannon, Zena M. Ariola, and Amr Sabry. A Typed Calculus Supporting Shallow Embeddings of Abstract Machines. In the APPSEM-II Workshop on the Krivine and ZINC Abstract Machines (KAZAM), 2005.
    PDF
  58. Slides in Active DVI format.
    Slides in PDF (but missing special effects)

  59. Eugenio Moggi and Amr Sabry. An Abstract Monadic Semantics for Value Recursion. In Theoretical Informatics and Applications, Volume 38, Number 4, October-December 2004.
    Postscript
    PDF
  60. ACM DL Author-ize serviceModeling quantum computing in Haskell

    Amr Sabry
    Haskell ’03 Proceedings of the 2003 ACM SIGPLAN workshop on Haskell, 2003

    PDF (Brazilian Portuguese translation by Antônio Carlos da Rocha Costa)
    Slides

  61. Eugenio Moggi and Amr Sabry. An Abstract Monadic Semantics for Value Recursion. Proceeding of the 2003 Workshop on Fixed Points in Computer Science (FICS), April 2003.
    Postscript
    PDF
  62. Daniel P. Friedman and Amr Sabry. CPS in Little Pieces: Composing Partial Continuations. Final version appears as a Theoretical Pearl in J. of Functional Programming volume 12, number 6, pages 617-622, November 2002. Copyright © 2002 Cambridge University Press.
    Postscript
  63. ACM DL Author-ize serviceMacros as multi-stage computations: type-safe, generative, binding macros in MacroML

    Steven E. Ganz, Amr Sabry, Walid Taha
    ICFP ’01 Proceedings of the sixth ACM SIGPLAN international conference on Functional programming, 2001
  64. Eugenio Moggi and Amr Sabry. Monadic Encapsulation of Effects: A Revised Approach (Extended Version). Final version appears in J. of Functional Programming, volume 11, number 6, pages 591-627, November 2001. Copyright © 2001 Cambridge University Press.
    Postscript
  65. Yong Xiao, Amr Sabry, and Zena M. Ariola. From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition. Final version appears in Higher-Order and Symbolic Computation, volume 14, number 4, pages 387-409, December 2001.
    Postscript
  66. Daniel P. Friedman and Amr Sabry. Recursion is a Computational Effect. Tech. Rep. TR546, Computer Science Department, Indiana University, December 2000.
    Postscript
    PDF
  67. Amr Sabry (ed.). Proceedings of the Third ACM SIGPLAN Workshop on Continuations. Technical Report TR545, Computer Science Department, Indiana University, 2000.
    Postscript
    PDF
  68. Matthias Felleisen and Amr Sabry. Continuations in Programming Practice: Introduction and Survey. Draft of August 26, 1999.
    Postscript
  69. John Fiskio-Lasseter and Amr Sabry. Putting Operational Techniques to the Test: A Syntactic Theory for Behavioral Verilog. In the Third International Workshop on Higher Order Operational Techniques in Semantics, 1999.
    Postscript
  70. Amr Sabry. Declarative Programming Across the Undergraduate Curriculum. In the Workshop on Functional and Declarative Programming in Education, 1999.
    FDPE Postscript
  71. ACM DL Author-ize serviceMonadic encapsulation in ML

    Miley Semmelroth, Amr Sabry
    ICFP ’99 Proceedings of the fourth ACM SIGPLAN international conference on Functional programming, 1999
  72. Amr Sabry and Stephen Fickas. Java Access Modifiers in Parallel Universes. Tech. Rep. CIS-TR-98-03, Dept. of Computer and Information Science, University of Oregon, 1998.
    Version 1 (Postscript)
    Version 1 (PDF)
    Version 2 (Postscript)
  73. Amr Sabry. A Programming Language Perspective to Compositional Software Architectures. Position paper in the Workshop on Compositional Software Architectures, 1998.
    HTML
  74. ACM DL Author-ize serviceCorrectness of monadic state: an imperative call-by-need calculus

    Zena M. Ariola, Amr Sabry
    POPL ’98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, 1998
  75. Amr Sabry. What is a Purely Functional Language? In J. Functional Programming, 8(1), 1-22, Jan. 1998. Copyright © 1998 Cambridge University Press.
    Postscript
  76. Amr Sabry and Jan Sparud. Debugging Reactive Systems in Haskell. In the ACM Haskell Workshop, 1997.
    Postscript
  77. ACM DL Author-ize serviceMonadic state: axiomatization and type safety

    John Launchbury, Amr Sabry
    ICFP ’97 Proceedings of the second ACM SIGPLAN international conference on Functional programming, 1997
  78. ACM DL Author-ize serviceA reflection on call-by-value

    Amr Sabry, Philip Wadler
    ACM Transactions on Programming Languages and Systems (TOPLAS), 1997
  79. ACM DL Author-ize serviceA reflection on call-by-value

    Amr Sabry, Philip Wadler
    ICFP ’96 Proceedings of the first ACM SIGPLAN international conference on Functional programming, 1996

    TR Postscript

  80. Amr Sabry. Note on Axiomatizing the Semantics of Control Operators. Tech. Rep. CIS-TR-96-03, Dept. of Computer and Information Science, University of Oregon, 1996.
    Postscript
  81. ACM DL Author-ize serviceProving the correctness of reactive systems using sized types

    John Hughes, Lars Pareto, Amr Sabry
    POPL ’96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, 1996
  82. Amr Sabry. The Formal Relationship between Direct and Continuation-Passing Style Optimizing Compilers: A Synthesis of Two Paradigms. Tech. Rep. TR94-241, Dept. of Computer Science, Rice University, 1994.
    Postscript
  83. ACM DL Author-ize serviceIs continuation-passing useful for data flow analysis?

    Amr Sabry, Matthias Felleisen
    PLDI ’94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, 1994

    TR Postscript

  84. ACM DL Author-ize serviceThe essence of compiling with continuations

    Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen
    PLDI ’93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation, 1993
  85. Amr Sabry and John Field. Reasoning about Explicit and Implicit Representations of State. In the ACM SIGPLAN Workshop on State in Programming Languages, 17-30. Tech. Rep. YALEU/DCS/RR-968, Dept. of Computer Science, Yale University, 1993.
    Postscript
  86. Amr Sabry and Matthias Felleisen. Reasoning with Continuations III: A Complete Calculus of Control. Personal Note, 1993.
    Postscript
  87. Amr Sabry and Matthias Felleisen. Reasoning about Programs in Continuation-Passing Style. In Lisp and Symbolic Computation, 6, 3/4, 289-360, 1993.
    Postscript
  88. ACM DL Author-ize serviceReasoning about programs in continuation-passing style.

    Amr Sabry, Matthias Felleisen
    LFP ’92 Proceedings of the 1992 ACM conference on LISP and functional programming, 1992

    TR Postscript