# Amr Sabry

According to our database

Collaborative distances:

^{1}, Amr Sabry authored at least 54 papers between 1992 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

An extended account of contract monitoring strategies as patterns of communication.

J. Funct. Program., 2018

From Reversible Programs to Univalent Universes and Back.

Electr. Notes Theor. Comput. Sci., 2018

Embracing the Laws of Physics: Three Reversible Models of Computation.

CoRR, 2018

From Symmetric Pattern-Matching to Quantum Control (Extended Version).

CoRR, 2018

A Library of Reversible Circuit Transformations (Work in Progress).

Proceedings of the Reversible Computation - 10th International Conference, 2018

From Symmetric Pattern-Matching to Quantum Control.

Proceedings of the Foundations of Software Science and Computation Structures, 2018

NANOPI: Extreme-Scale Actively-Secure Multi-Party Computation.

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017

From Reversible Programs to Univalent Universes and Back.

CoRR, 2017

2016

Computing with Semirings and Weak Rig Groupoids.

Proceedings of the Programming Languages and Systems, 2016

2015

Reversible Communicating Processes.

Proceedings of the Proceedings Eighth International Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software, 2015

Expressing contract monitors as patterns of communication.

Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

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, 2013

Extensible effects: an alternative to monad transformers.

Proceedings of the 2013 ACM SIGPLAN Symposium on Haskell, 2013

2012

Isomorphic Interpreters from Logically Reversible Abstract Machines.

Proceedings of the Reversible Computation, 4th International Workshop, 2012

Information effects.

Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

Lazy v. Yield: Incremental, Linear Pretty-Printing.

Proceedings of the Programming Languages and Systems - 10th Asian Symposium, 2012

2010

Lazy Evaluation and Delimited Control

Logical Methods in Computer Science, 2010

2009

Sequent calculi and abstract machines.

ACM Trans. Program. Lang. Syst., 2009

A type-theoretic foundation of delimited continuations.

Higher-Order and Symbolic Computation, 2009

The Arrow Calculus as a Quantum Programming Language.

Proceedings of the Logic, 2009

Reasoning about General Quantum Programs over Mixed States.

Proceedings of the Formal Methods: Foundations and Applications, 2009

Lazy evaluation and delimited control.

Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2009

2008

Side Effects.

Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Quantum Arrows in Haskell.

Electr. Notes Theor. Comput. Sci., 2008

2007

A proof-theoretic foundation of abortive continuations.

Higher-Order and Symbolic Computation, 2007

A monadic framework for delimited continuations.

J. Funct. Program., 2007

An Algebra of Pure Quantum Programming.

Electr. Notes Theor. Comput. Sci., 2007

2006

Structuring quantum effects: superoperators as arrows.

Mathematical Structures in Computer Science, 2006

Delimited dynamic binding.

Proceedings of the 11th ACM SIGPLAN International Conference on Functional Programming, 2006

2005

Structuring quantum effects: superoperators as arrows

CoRR, 2005

Backtracking, interleaving, and terminating monad transformers: (functional pearl).

Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, 2005

2004

An abstract monadic semantics for value recursion.

ITA, 2004

A type-theoretic foundation of continuations and prompts.

Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming, 2004

2003

Modeling quantum computing in Haskell.

Proceedings of the ACM SIGPLAN Workshop on Haskell, 2003

2002

Editorial.

Higher-Order and Symbolic Computation, 2002

CPS in little pieces: composing partial continuations.

J. Funct. Program., 2002

2001

From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition.

Higher-Order and Symbolic Computation, 2001

Monadic encapsulation of effects: a revised approach (extended version).

J. Funct. Program., 2001

Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML.

Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming (ICFP '01), 2001

1999

Putting Operational Techniques to the Test: A Syntactic Theory for Behavioral Verilog.

Electr. Notes Theor. Comput. Sci., 1999

Monadic Encapsulation in ML.

Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), 1999

1998

What is a Purely Functional Language?

J. Funct. Program., 1998

Correctness of Monadic State: An Imperative Call-by-Need Calculus.

Proceedings of the POPL '98, 1998

1997

A Reflection on Call-by-Value.

ACM Trans. Program. Lang. Syst., 1997

Correctness of Monadic State: An Imperative Call-by-Need Calculus.

Electr. Notes Theor. Comput. Sci., 1997

Monadic State: Axiomatization and Type Safety.

Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP '97), 1997

1996

Proving the Correctness of Reactive Systems Using Sized Types.

Proceedings of the Conference Record of POPL'96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1996

A Reflection on Call-by-Value.

Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, 1996

1994

Is Continuation-Passing Useful for Data Flow Analysis?

Proceedings of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation (PLDI), 1994

The formal relationship between direct and continuation-passing style optimizing compilers - a synthesis of two paradigms.

PhD thesis, 1994

1993

Reasoning about Programs in Continuation-Passing Style.

Lisp and Symbolic Computation, 1993

The essence of compiling with continuations (with retrospective)

Proceedings of the 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999, 1993

The Essence of Compiling with Continuations.

Proceedings of the ACM SIGPLAN'93 Conference on Programming Language Design and Implementation (PLDI), 1993

1992

Reasoning About Programs in Continuation-Passing Style.

Proceedings of the Conference on Lisp and Functional Programming, 1992