A Type-Theoretic Foundation of Delimited Continuations (2007)
Ariola, Zena, Herbelin, Hugo, Sabry, Amr
There is a correspondence between classical logic and programming language calculi with first-class continuations. With the addition of control delimiters, the continuations become composable and the...
Control Reduction Theories: the Benefit of Structural Substitution (2007)
The historical design of the call-by-value theory of control relies on the reification of evaluation contexts as regular functions and on the use of ordinary term application for jumping to a...
A Type-Theoretic Foundation of Delimited Continuations (2007)
Ariola, Zena, Herbelin, Hugo, Sabry, Amr
There is a correspondence between classical logic and programming language calculi with first-class continuations. With the addition of control delimiters, the continuations become composable and the...
Control Reduction Theories: the Benefit of Structural Substitution (2007)
The historical design of the call-by-value theory of control relies on the reification of evaluation contexts as regular functions and on the use of ordinary term application for jumping to a...
From syntactic theories to interpreters: Automating the proof of unique decomposition (2004)
Yong Xiao, Amr Sabry, Zena Ariola
Abstract. Developing syntactic theories for reasoning about programming languages usually involves proving a unique decomposition lemma. The proof of such a lemma is tedious, and error-prone, and is...
Minimal Classical Logic and Control Operators (2003)
We give an analysis of various classical axioms and characterize a notion of minimal classical logic that enforces Peirce's law without enforcing Ex Falso Quodlibet. We show that a...
The Call-By-Need Lambda Calculus (1995)
Zena Ariola, Matthias Felleisen
Plotkin [Theor. Comp. Sci. 1975] showed that the lambda calculus is a good model of the evaluation process for call-by-name functional programs. Reducing programs to constants or lambda abstractions...
Properties of a First-order Functional Language with Sharing (1995)
this paper, we discuss the syntactic and semantic properties of a calculus, which is adequate for capturing the sharing of subexpressions in first-order functional languages. The results of this...
Syntactic definitions of undefined: on defining the undefined (Extended Abstract) (1994)
Zena Ariola, Richard Kennaway, Jan Willem Klop
Zena Ariola 1 , Richard Kennaway 2 , Jan Willem Klop 3 , Ronan Sleep 4 and Fer-Jan de Vries 5 1 Computer and Information Science Department, University of Oregon, Eugene, Oregon 2;4 School of...
The Call-By-Need Lambda Calculus (1993)
Zena Ariola, Matthias Felleisen
Plotkin [Theor. Comp. Sci. 1975] showed that the lambda calculus is a good model of the evaluation process for call-by-name functional programs. Reducing programs to constants or lambda abstractions...
William D. CLinger, Zena Ariola
The aggregate update problem in functional languages is concerned with detecting cases where a functional array update operation can be implemented destructively in constant time. Previous work on...