Hot Links
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) 8690481,
or permissions ... acm org.
 Hamidreza Bahramian, Narges Nematollahi, and Amr
Sabry, Copredication in Homotopy Type Theory: A homotopical approach to
formal semantics of natural languages. To appear in the Fourth
Workshop on Natural Language and Computer Science, NLCS '16 .
 Jacques Carette and Amr Sabry, Computing with Semirings and Weak Rig
Groupoids. In the European Symposium on Programming, ESOP 2016.
PDF
 Cameron Swords, Amr Sabry, and Sam TobinHochstadt. Contract
Monitoring Semantics as Patterns of Communication. In
the International Conference on Functional Programming, ICFP 2015.
PDF
 Geoffrey Brown and Amr Sabry. Reversible Communicating
Processes. In the Workshop on Programming Language Approaches to
Concurrency and CommunicationcEntric Software, PLACES 2015.
PDF
 Zachary Sparks and Amr Sabry. Superstructural Reversible Logic. In the 3rd International Workshop on Linearity, 2014.
PDF
 Roshan P. James and Amr Sabry.
Theseus: A High Level Language for Reversible Computing.
Workinprogress report in the
Conference on Reversible Computation, 2014.
PDF
 Andrew J. Hanson, Gerardo Ortiz, Amr Sabry, and YuTsung 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.)
 Oleg Kiselyov, Amr Sabry, and Cameron Swords.
Extensible Effects: An Alternative to Monad Transformers.
In the Haskell Symposium, 2013.
PDF
 Doaa Hassan and Amr Sabry.
Encoding Secure Information Flow with Restricted Delegation and Revocation in Haskell.
In the Workshop on Functional Programming Concepts in DomainSpecific Languages, 2013.
PDF
 Andrew J. Hanson, Gerardo Ortiz, Amr Sabry, and YuTsung 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
 Oleg Kiselyov, Simon PeytonJones, and Amr Sabry. Lazy v. Yield:
Incremental, Linear Prettyprinting. In the Asian Symposium on
Programming Languages and Systems, APLAS 2012.
PDF
Clojure port by Brandon Bloom
 Roshan P. James and Amr Sabry. Isomorphic Interpreters from Logically
Reversible Abstract Machines. In the Workshop on Reversible
Computation, RC 2012.
PDF
 Roshan P. James and Amr Sabry. Embracing the Laws of Physics. In
the Off the Beaten Track workshop, OBT 2012.
PDF
PDF slides

 Roshan P. James and Amr Sabry. Yield, the control operator:
exploring session types. In the Continuation Workshop, CW 2011.
PDF slides
 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
 Andrew J. Hanson, Gerardo Ortiz, Amr Sabry, and Jeremiah Willcock. The
Power of Discrete Quantum Theories, 2011.
arXiv entry
 Roshan P. James, Gerardo Ortiz, and Amr Sabry. Quantum Computing over
Finite Fields: Reversible Relational Programming with Exclusive
Disjunctions, 2011.
arXiv entry
 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
 Jeremiah Willcock and Amr Sabry. Solving UNIQUESAT in a Modal Quantum
Theory, 2011.
arXiv entry
 Ronald Garcia, Andrew Lumsdaine, and Amr Sabry. Lazy Evaluation and
Delimited Control. Logical Methods in Computer Science, Volume
6, Number 3, 2010.
 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.
 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

 Amr
Sabry. Side Effects. In the Encyclopedia of Computer
Science and Computer Engineering, 2008.
PDF
 Larisse D. Voufo,
Gerardo Ortiz, and
Amr Sabry.
Quantum Circuits: From a Network to a OneWay Model. In DCMQPL,
2008.
Tutorial version appears as
Technical Report 665, Computer Science
Department, Indiana University, 2008.
 Zena M. Ariola and
Hugo Herbelin and
Amr Sabry.
A TypeTheoretic Foundation of Delimited Continuations. Higher Order and
Symbolic Computation, ISSN 13883690 (Print) 15730557 (Online), October
2007.
Postscript
PDF
 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.

Haskell code (tar file)
 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

 R. Kent Dybvig,
Simon PeytonJones, and
Amr Sabry.
A Monadic Framework for Delimited Continuations. J. Functional Programming, volume 17 , issue 6, pages 687730, November 2007.
Postscript
PDF
Tech. Rep. TR615, Computer Science Department, Indiana University, June 2005.
Gzipped tar file with the code
 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)
 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. 2347, 2007:
PDF

 Zena M. Ariola,
Hugo Herbelin, and
Amr Sabry.
A ProofTheoretic Foundation of Abortive Continuations. HigherOrder and
Symbolic Computation, volume 20, number 4, pages 403429, December 2007.
Postscript
PDF
Extended version:
Technical Report TR608, Computer Science Department, Indiana University, 2005.
(Postscript,
PDF)
 Aaron Bohannon,
Zena M. Ariola, and
Amr Sabry.
A Typed Calculus Supporting Shallow Embeddings of Abstract Machines. In the
APPSEMII Workshop on the Krivine and ZINC Abstract Machines (KAZAM), 2005.
PDF

Slides in
Active DVI format.
Slides in PDF (but missing special effects)
 Eugenio Moggi and
Amr Sabry.
An Abstract Monadic Semantics for Value Recursion. In
Theoretical Informatics and Applications, Volume 38, Number 4,
OctoberDecember 2004.
Postscript
PDF


PDF
(Brazilian Portuguese translation by Antônio Carlos da Rocha Costa)
Slides
 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
 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
617622, November 2002. Copyright © 2002 Cambridge University
Press.
Postscript

 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 591627, November
2001. Copyright © 2001 Cambridge University Press.
Postscript
 Yong Xiao,
Amr Sabry, and
Zena M. Ariola.
From Syntactic Theories to Interpreters: Automating the Proof of Unique
Decomposition. Final version appears in HigherOrder and Symbolic
Computation, volume 14, number 4, pages 387409, December 2001.
Postscript
 Daniel P. Friedman and
Amr Sabry.
Recursion is a Computational Effect.
Tech. Rep. TR546, Computer Science Department, Indiana University, December
2000.
Postscript
PDF
 Amr Sabry (ed.).
Proceedings of the Third ACM SIGPLAN Workshop on Continuations.
Technical Report TR545, Computer Science Department, Indiana University, 2000.
Postscript
PDF
 Matthias Felleisen
and Amr Sabry.
Continuations in Programming Practice: Introduction and Survey.
Draft of August 26, 1999.
Postscript
 John FiskioLasseter 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
 Amr Sabry.
Declarative Programming Across the Undergraduate
Curriculum. In the Workshop on Functional and Declarative
Programming in Education, 1999.
FDPE Postscript

 Amr Sabry and
Stephen Fickas.
Java Access Modifiers in Parallel Universes. Tech. Rep. CISTR9803,
Dept. of Computer and Information Science, University of Oregon, 1998.
Version 1 (Postscript)
Version 1 (PDF)
Version 2 (Postscript)
 Amr Sabry.
A Programming Language Perspective to Compositional Software
Architectures. Position paper in the Workshop on Compositional
Software Architectures, 1998.
HTML

 Amr Sabry.
What is a Purely Functional Language? In J. Functional Programming,
8(1), 122, Jan. 1998. Copyright © 1998 Cambridge University
Press.
Postscript
 Amr Sabry and
Jan Sparud.
Debugging Reactive Systems in Haskell. In the ACM Haskell Workshop, 1997.
Postscript



TR Postscript
 Amr Sabry.
Note on Axiomatizing the Semantics of Control Operators.
Tech. Rep. CISTR9603, Dept. of Computer and Information
Science, University of Oregon, 1996.
Postscript

 Amr Sabry.
The Formal Relationship between Direct and ContinuationPassing Style
Optimizing Compilers: A Synthesis of Two Paradigms.
Tech. Rep. TR94241, Dept. of Computer Science, Rice University, 1994.
Postscript

TR Postscript

 Amr Sabry and
John Field.
Reasoning about Explicit and Implicit Representations of
State. In the ACM SIGPLAN Workshop on State in Programming
Languages, 1730. Tech. Rep. YALEU/DCS/RR968, Dept. of Computer
Science, Yale University, 1993.
Postscript
 Amr Sabry and
Matthias Felleisen.
Reasoning with Continuations III: A Complete Calculus of Control.
Personal Note, 1993.
Postscript
 Amr Sabry and
Matthias Felleisen.
Reasoning about Programs in ContinuationPassing Style.
In Lisp and Symbolic Computation, 6, 3/4, 289360, 1993.
Postscript

TR Postscript
