School of Informatics and Computing

Hot Links

• The 1st ACM SIGPLAN Workshop on Higher-Order Programming with Effects (the day before ICFP 2012) --- HOPE'12

• The International Symposium on Symbolic Computation in Software Science --- SCSS'12

Software

• Paul Purdom and Amr Sabry. CNF Generator for Factoring Problems, May 2003.

• The OJVM, 2000 (with an update in 2007)

Research papers

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.

• Roshan P. James and Amr Sabry. The Two Dualities of Computation: Negative and Fractional Types, 2012.
  PDF
  PDF slides presented at the Turing Symposium

• Roshan P. James and Amr Sabry. Isomorphic Interpreters from Logically Reversible Abstract Machines. In 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, 2012.
  PDF slides

• Information effects

  Roshan P. James, Amr Sabry
  ACM SIGPLAN Notices - POPL '12, 2012

• Roshan P. James and Amr Sabry. Yield, the control operator: exploring session types. In the Continuation Workshop 2011.
  PDF slides

• William J. Bowman, Roshan P. James, and Amr Sabry. Dagger Traced Symmetric Monoidal Categories and Reversible Programming. In Workshop on Reversible Computation, RC 2011.
  PDF
  Code

• Andrew J. Hanson, Gerardo Ortiz, Amr Sabry, and Jeremiah Willcok. 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 Theory and Practice of Delimited Continuations, TPDC 2011.
  PDF
  Code

• Jeremiah Willcock and Amr Sabry. Solving UNIQUE-SAT in a Modal Quantum Theory, 2011.
  arXiv entry

• Ronald Garcia, Andrew Lumsdaine, and Amr Sabry. Lazy Evaluation and Delimited Control. In 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

• Lazy 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

• Amr Sabry. Side Effects. In the Encyclopedia of Computer Science and Computer Engineering, 2008.
  

• 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.

• 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

• 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.
  

• Sequent calculi and abstract machines

  Zena M. Ariola, Aaron Bohannon, Amr Sabry
  ACM Transactions on Programming Languages and Systems (TOPLAS), 2009
  
  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

• Delimited dynamic binding

  Oleg Kiselyov, Chung-chieh Shan, Amr Sabry
  ICFP '06 Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming, 2006

• 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

• 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. 23-47, 2007:
  PDF

• Backtracking, 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

• 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)

• 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

• A type-theoretic foundation of continuations and prompts

  Zena M. Ariola, Hugo Herbelin, Amr Sabry
  ACM SIGPLAN Notices - ICFP '04, 2004
  
  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, October-December 2004.
  Postscript
  PDF

• The essence of compiling with continuations

  Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen
  ACM SIGPLAN Notices - Best of PLDI 1979-1999, 2004

• Modeling 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

• 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 617-622, November 2002. Copyright © 2002 Cambridge University Press.
  Postscript

• Macros 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

• 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

• 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

• 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 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

• Amr Sabry. Declarative Programming Across the Undergraduate Curriculum. In the Workshop on Functional and Declarative Programming in Education, 1999.
  FDPE Postscript

• Monadic encapsulation in ML

  Miley Semmelroth, Amr Sabry
  ICFP '99 Proceedings of the fourth ACM SIGPLAN international conference on Functional programming, 1999

• 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)

• Amr Sabry. A Programming Language Perspective to Compositional Software Architectures. Position paper in the Workshop on Compositional Software Architectures, 1998.
  HTML

• Correctness 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

• Amr Sabry. What is a Purely Functional Language? In J. Functional Programming, 8(1), 1-22, 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

• Monadic state: axiomatization and type safety

  John Launchbury, Amr Sabry
  ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming, 1997

• A reflection on call-by-value

  Amr Sabry, Philip Wadler
  ACM Transactions on Programming Languages and Systems (TOPLAS), 1997

• A 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

• 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

• Proving 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

• 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

• Is 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

• The 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

• 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

• 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 Continuation-Passing Style. In Lisp and Symbolic Computation, 6, 3/4, 289-360, 1993.
  Postscript

• Reasoning 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