Proof nets and the call-by-value lambda-calculus

@inproceedings{Accattoli2012ProofNA,
  title={Proof nets and the call-by-value lambda-calculus},
  author={Beniamino Accattoli},
  booktitle={LSFA},
  year={2012}
}
This paper gives a detailed account of the relationship between (a variant of) the call-by-value lambda calculus and linear logic proof nets. The presentation is carefully tuned in order to realize a strong bisimulation between the two systems: every single rewriting step on the calculus maps to a single step on the nets, and viceversa. In this way, we obtain an algebraic reformulation of proof nets. Moreover, we provide a simple correctness criterion for our proof nets, which employ boxes in… Expand
8 Citations
Proof nets and the call-by-value λ-calculus
  • 23
  • PDF
Proof Nets and the Linear Substitution Calculus
  • 14
  • PDF
Head reduction and normalization in a call-by-value lambda-calculus
  • 16
  • PDF
Open Call-by-Value
  • 30
  • PDF
On the Value of Variables
  • 24
  • PDF
On the value of variables
  • 4
  • PDF
On the Value of Variables Beniamino Accattoli
  • PDF
Types of Fireballs
  • 15
  • PDF

References

SHOWING 1-10 OF 63 REFERENCES
Call-by-Value Solvability, Revisited
  • 35
  • PDF
Polarized Proof-Nets: Proof-Nets for LC
  • 41
  • PDF
Resource operators for lambda-calculus
  • 44
Encoding Strategies in the Lambda Calculus with Interaction Nets
  • 9
  • Highly Influential
Polarized proof-nets and lambda-µ-calculus
  • O. Laurent
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2003
  • 59
A Semantical and Operational Account of Call-by-Value Solvability
  • 43
  • PDF
Evaluating functions as processes
  • 20
  • PDF
Proof Nets and Explicit Substitutions
  • 51
  • PDF
Intuitionistic differential nets and lambda-calculus
  • P. Tranquilli
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2011
  • 41
  • PDF
...
1
2
3
4
5
...