• Publications
  • Influence
The Bang Calculus and the Two Girard's Translations
TLDR
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
  • 16
  • 5
  • PDF
The Bang Calculus: an untyped lambda-calculus generalizing call-by-name and call-by-value
TLDR
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
  • 33
  • 3
  • PDF
Open Call-by-Value
TLDR
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
  • 30
  • 2
  • PDF
Head reduction and normalization in a call-by-value lambda-calculus
TLDR
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
  • 16
  • 2
  • PDF
Abstract machines for Open Call-by-Value
TLDR
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
  • 4
  • 2
  • PDF
A Semantical and Operational Account of Call-by-Value Solvability
TLDR
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
  • 43
  • 1
  • PDF
Types of Fireballs
TLDR
The good properties of Plotkin’s call-by-value lambda-calculus crucially rely on the restriction to weak evaluation and closed terms. Expand
  • 15
  • 1
  • PDF
Standardization of a Call-By-Value Lambda-Calculus
TLDR
We study an extension of Plotkin's call-by-value lambda-calculus by means of two commutation rules (sigma-reductions). Expand
  • 18
  • 1
  • PDF
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus
TLDR
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
  • 16
  • 1
  • PDF
Types by Need
TLDR
A cornerstone of the theory of \(\lambda \)-calculus is that intersection types characterise termination properties. Expand
  • 13
  • 1
  • PDF
...
1
2
3
4
5
...