We study the two Girard's translations of intuitionistic implication into linear logic by exploiting the bang calculus, a paradigmatic functional language with an explicit box-operator that allows both call- by-name and call-by-value lambda-calculi to be encoded in.Expand

We introduce and study the Bang Calculus, an untyped functional calculus in which the promotion operation of Linear Logic is made explicit and where application is a bilinear operation.Expand

The elegant theory of the call-by-value lambda-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programming languages.Expand

We study the head normalization for this call-by-value calculus with sigma-reductions and we relate it to the weak evaluation of original Plotkin's call- by-value lambda-calculus.Expand

Abstract The theory of the call-by-value λ-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programming languages.Expand

In Plotkin’s call-by-value lambda-calculus, solvable terms are characterized syntactically by means of call by-name reductions and there is no neat semantical characterization of such terms.Expand

We study an extension of Plotkin's call-by-value lambda-calculus via two commutation rules (sigma-reductions) and show that it enjoys elegant characterizations of many semantic properties.Expand