Results 1  10
of
828
Equivalence in Functional Languages with Effects
, 1991
"... Traditionally the view has been that direct expression of control and store mechanisms and clear mathematical semantics are incompatible requirements. This paper shows that adding objects with memory to the callbyvalue lambda calculus results in a language with a rich equational theory, satisfying ..."
Abstract

Cited by 121 (13 self)
 Add to MetaCart
Traditionally the view has been that direct expression of control and store mechanisms and clear mathematical semantics are incompatible requirements. This paper shows that adding objects with memory to the callbyvalue lambda calculus results in a language with a rich equational theory
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 is introduced, that may jeopardise the ap ..."
Abstract

Cited by 501 (6 self)
 Add to MetaCart
the applicability of theoretical results to real situations. In this paper we introduce a new calculus based on a categorical semantics for computations. This calculus provides a correct basis for proving equivalence of programs, independent from any specific computational model.
Copyright C
"... Traditionally the view has been that direct expression of control and store mechanisms and clear mathematical semantics are incompatible requirements. This paper shows that adding objects with memory to the callbyvalue lambda calculus results in a language with a rich equational theory, satisfying ..."
Abstract
 Add to MetaCart
Traditionally the view has been that direct expression of control and store mechanisms and clear mathematical semantics are incompatible requirements. This paper shows that adding objects with memory to the callbyvalue lambda calculus results in a language with a rich equational theory
– Callbyvalue lambda calculus
, 2005
"... • While the calculus was originally described by Church in the 1930s, it wasn’t until Plotkin in 1975 that the distinction between callbyname and callbyvalue was made. • Callbyname means that (λx.e)e2 � e[x: = e2] holds; under callbyvalue, (λx.e)v � e[x: = v] is true (and no lessrestrictive ..."
Abstract
 Add to MetaCart
• While the calculus was originally described by Church in the 1930s, it wasn’t until Plotkin in 1975 that the distinction between callbyname and callbyvalue was made. • Callbyname means that (λx.e)e2 � e[x: = e2] holds; under callbyvalue, (λx.e)v � e[x: = v] is true (and no less
Spaceprofiling semantics of the callbyvalue lambda calculus and the CPS transformation
 In The 3rd International Workshop on Higher Order Operational Techniques in Semantics, volume 26 of Electronic Notes in Theoretical Computer Science
, 1999
"... We show that the CPS transformation from the callbyvalue lambda calculus to a CPS language preserves space required for execution of a program within a constant factor. For the callbyvalue lambda calculus we adopt a spaceprofiling semantics based on the profiling semantics of NESL by Blelloch a ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We show that the CPS transformation from the callbyvalue lambda calculus to a CPS language preserves space required for execution of a program within a constant factor. For the callbyvalue lambda calculus we adopt a spaceprofiling semantics based on the profiling semantics of NESL by Blelloch
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.
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.
LIGHT LOGICS AND THE CALLBYVALUE LAMBDA CALCULUS
, 2007
"... Vol. 4 (4:5) 2008, pp. 1–28 www.lmcsonline.org ..."
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
The callbyvalue lambdacalculus, the SECD machine, and the picalculus
, 2000
"... We present an encoding of the callbyvalue lambdacalculus into the picalculus, alternative to the wellknown Milner's encodings. We show that our encoding is barbed congruent (under typed contexts) to Milner's "light" encoding, and that it takes two pisteps to mimic a betare ..."
Abstract
 Add to MetaCart
We present an encoding of the callbyvalue lambdacalculus into the picalculus, alternative to the wellknown Milner's encodings. We show that our encoding is barbed congruent (under typed contexts) to Milner's "light" encoding, and that it takes two pisteps to mimic a beta
Results 1  10
of
828