Amr Sabry

Dr. Amr Sabry

orcid

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 1993
Verified
Conference Paper
Open access
PDF file
CFCormac Flanagan
Cormac Flanagan
ASAmr Sabry
Amr Sabry
BDBruce F. Duba
Bruce F. Duba
MFMatthias Felleisen
Matthias Felleisen

1 January 1996
Verified
Conference Paper
Open access
PDF file
JHJohn Hughes
John Hughes
LPLars Pareto
Lars Pareto
ASAmr Sabry
Amr Sabry

1 November 1997 in ACM Transactions on Programming Languages and Systems
Verified
Journal Article
Open access
PDF file
ASAmr Sabry
Amr Sabry
PWPhilip Wadler
Philip Wadler
One way to model a sound and complete translation from a source calculus into a target calculus is with anadjointor aGalois connection. In the special case of areflection, one also has that the target calculus is isomorphic to a subset of the source. We show that three widely studied translations form reflections. We use as our source language Moggi's computational lambda calculus, which is an extension of Plotkin's call-by-value calculus. We show that Plotkin's CPS translation, Moggi's monad translation, and Girard's translation to linear logic can all be regarded as reflections form this source language, and we put forward the computational lambda calculus as a model of call-by-value computation that improves on the traditional call-by-value calculus. Our work strengthens Plotkin's and Moggi's original results and improves on recent work based onequational correspondence, which uses equations rather than reductions.

1 January 1992
Verified
Conference Paper
Open access
PDF file
ASAmr Sabry
Amr Sabry
MFMatthias Felleisen
Matthias Felleisen

1 May 2007 in Journal of Functional Programming
Verified
Journal Article
Closed access
PDF file
RDR. Kent Dyvbig
R. Kent Dyvbig
SJSimon Peyton Jones
Simon Peyton Jones
ASAmr Sabry
Amr Sabry
Delimited continuations are more expressive than traditional abortive continuations and they apparently require a framework beyond traditional continuation-passing style (CPS). We show that this is not the case: standard CPS is sufficient to explain the common control operators for delimited continuations. We demonstrate this fact and present an implementation as a Scheme library. We then investigate a typed account of delimited continuations that makes explicit where control effects can occur. This results in a monadic framework for typed and encapsulated delimited continuations, which we design and implement as a Haskell library.

12 September 2005
Verified
Conference Paper
Open access
PDF file
OKOleg Kiselyov
Oleg Kiselyov
CSChung-Chieh Shan
Chung-Chieh Shan
DFDaniel P. Friedman
Daniel P. Friedman
ASAmr Sabry
Amr Sabry
We design and implement a library for adding backtracking computations to any Haskell monad. Inspired by logic programming, our library provides, in addition to the operations required by the MonadPlus interface, constructs for fair disjunctions, fair conjunctions, conditionals, pruning, and an expressive top-level interface. Implementing these additional constructs is easy in models of backtracking based on streams, but not known to be possible in continuation-based models. We show that all these additional constructs can be generically and monadically realized using a single primitive msplit. We present two implementations of the library: one using success and failure continuations; and the other using control operators for manipulating delimited continuations.