Results 1  10
of
124,061
The Logic and Expressibility of Simplytyped Callbyvalue and Lazy Languages
, 1991
"... We study the operational, denotational, and axiomatic semantics of lazy and callbyvalue functional languages, and use these semantics to build a new expressiveness theory for comparing functional languages. The first part of the thesis develops the theory of lazy and callbyvalue languages separa ..."
Abstract
 Add to MetaCart
separately, following paradigmatic studies of callbyname functional languages. We first describe the operational semantics of two simplytyped languages, lazy PCF and callbyvalue PCF. These two languages provide enough intuition to describe general definitions of denotational models and logics for lazy
Computational LambdaCalculus and Monads
, 1988
"... The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract

Cited by 505 (7 self)
 Add to MetaCart
The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise
Stackability in the SimplyTyped, CallbyValue Lambda Calculus
 IN PROCEEDINGS OF THE FIRST INTERNATIONAL STATIC ANALYSIS SYMPOSIUM
, 1994
"... This paper addresses two issues: (1) What it means for a higherorder, eager functional language to be implemented with a single, global, stackbased environment and (2) how the existence of such an environment can be predicted statically. The central theme is the use of theabstraction to control th ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
the extent or lifetime of bindings. All programs in a higherorder, callbyname language can be implemented with a stack environment. The reason: soundness of jexpansion and decurrying for callbyname. However, jexpansion is unsound for callbyvalue. Hence, we must identify a subset of the simplytyped
The Structure of CallbyValue
, 2000
"... To my parents Understanding procedure calls is crucial in computer science and everyday programming. Among the most common strategies for passing procedure arguments (‘evaluation strategies’) are ‘callbyname’, ‘callbyneed’, and ‘callbyvalue’, where the latter is the most commonly used. While ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
for callbyneed, and none occur for callbyname. In that sense, callbyvalue is the ‘greatest common denominator ’ of the three evaluation strategies. Reasoning about callbyvalue programs has been tackled by Eugenio Moggi’s ‘computational lambdacalculus’, which is based on a distinction between
Recursion in the CallbyValue λCalculus
, 2002
"... We propose an abstract machine to run the callbyvalue lambdacalculus extended with a callbyvalue fixedpoint, and we show that this provides us with a correct implementation of our calculus. ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We propose an abstract machine to run the callbyvalue lambdacalculus extended with a callbyvalue fixedpoint, and we show that this provides us with a correct implementation of our calculus.
Category Theory and the SimplyTyped lambdaCalculus
, 1996
"... This report deals with the question on how to provide a categorical model for the simplytyped calculus. We first introduce cartesian closed categories and work in detail a number of results concerning this construction. Next, we present the basic concepts related with the typed calculus, i.e., co ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This report deals with the question on how to provide a categorical model for the simplytyped calculus. We first introduce cartesian closed categories and work in detail a number of results concerning this construction. Next, we present the basic concepts related with the typed calculus, i
LIGHT LOGICS AND THE CALLBYVALUE LAMBDA CALCULUS
, 809
"... Abstract. The socalled light logics [13, 1, 2] have been introduced as logical systems enjoying quite remarkable normalization properties. Designing a type assignment system for pure lambda calculus from these logics, however, is problematic, as discussed in [6]. In this paper we show that shifting ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
that shifting from usual callbyname to callbyvalue lambda calculus allows regaining strong connections with the underlying logic. This will be done in the context of Elementary Affine Logic (EAL), designing a type system in natural deduction style assigning EAL formulae to lambda terms. 1.
CallByName, CallByValue and Time
"... Abstract. We build denotational models for the callbyname and callbyvalue versions of a simply typed lambda calculus with recursion, and show that they are adequate: the denotation of a closed term of base type represents exactly the number of reduction steps. We achieve this in a very generic wa ..."
Abstract
 Add to MetaCart
Abstract. We build denotational models for the callbyname and callbyvalue versions of a simply typed lambda calculus with recursion, and show that they are adequate: the denotation of a closed term of base type represents exactly the number of reduction steps. We achieve this in a very generic
Results 1  10
of
124,061