Results 1 - 10 of 828

Equivalence in Functional Languages with Effects

by Ian Mason, Carolyn Talcott , 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 call-by-value 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 call-by-value lambda calculus results in a language with a rich equational theory

Computational Lambda-Calculus and Monads

by Eugenio Moggi , 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 fij-conversion 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

by By Ian Mason, Ian Mason, Carolyn Talcott
"... 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 call-by-value 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 call-by-value lambda calculus results in a language with a rich equational theory

– Call-by-value lambda calculus

by Scribe Dan Smith , 2005
"... • While the calculus was originally described by Church in the 1930s, it wasn’t until Plotkin in 1975 that the distinction between call-by-name and call-by-value was made. • Call-by-name means that (λx.e)e2 � e[x: = e2] holds; under call-by-value, (λx.e)v � e[x: = v] is true (and no less-restrictive ..."
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 call-by-name and call-by-value was made. • Call-by-name means that (λx.e)e2 � e[x: = e2] holds; under call-by-value, (λx.e)v � e[x: = v] is true (and no less

Space-profiling semantics of the call-by-value lambda calculus and the CPS transformation

by Yasuhiko Minamide - 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 call-by-value lambda calculus to a CPS language preserves space required for execution of a program within a constant factor. For the call-by-value lambda calculus we adopt a space-profiling 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 call-by-value lambda calculus to a CPS language preserves space required for execution of a program within a constant factor. For the call-by-value lambda calculus we adopt a space-profiling semantics based on the profiling semantics of NESL by Blelloch

Recursion in the Call-by-Value λ-Calculus

by Gérard Boudol, Pascal Zimmer, Inria Sophia Antipolis , 2002
"... We propose an abstract machine to run the call-by-value lambda-calculus extended with a call-by-value fixed-point, 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 call-by-value lambda-calculus extended with a call-by-value fixed-point, and we show that this provides us with a correct implementation of our calculus.

LIGHT LOGICS AND THE CALL-BY-VALUE LAMBDA CALCULUS

by Paolo Coppola, Ugo Dal Lago, Simona, Ronchi Della Rocca, Udine Italy , 809
"... Abstract. The so-called 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 call-by-name to call-by-value 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 CALL-BY-VALUE LAMBDA CALCULUS

by Paolo Coppola A, Ugo Dal Lago B, Simona, Ronchi Della Rocca , 2007
"... Vol. 4 (4:5) 2008, pp. 1–28 www.lmcs-online.org ..."
Abstract - Add to MetaCart
Vol. 4 (4:5) 2008, pp. 1–28 www.lmcs-online.org

The Structure of Call-by-Value

by Carsten Führmann , 2000
"... To my parents Understanding procedure calls is crucial in computer science and everyday pro-gramming. Among the most common strategies for passing procedure argu-ments (‘evaluation strategies’) are ‘call-by-name’, ‘call-by-need’, and ‘call-by-value’, where the latter is the most commonly used. While ..."
Abstract - Cited by 12 (3 self) - Add to MetaCart
for call-by-need, and none occur for call-by-name. In that sense, call-by-value is the ‘greatest common denominator ’ of the three evaluation strategies. Reasoning about call-by-value programs has been tackled by Eugenio Moggi’s ‘computational lambda-calculus’, which is based on a distinction between

The call-by-value lambda-calculus, the SECD machine, and the pi-calculus

by Vasco T. Vasconcelos , 2000
"... We present an encoding of the call-by-value lambda-calculus into the pi-calculus, alternative to the well-known Milner's encodings. We show that our encoding is barbed congruent (under typed contexts) to Milner's "light" encoding, and that it takes two pi-steps to mimic a beta-re ..."
Abstract - Add to MetaCart
We present an encoding of the call-by-value lambda-calculus into the pi-calculus, alternative to the well-known Milner's encodings. We show that our encoding is barbed congruent (under typed contexts) to Milner's "light" encoding, and that it takes two pi-steps to mimic a beta
Results 1 - 10 of 828