Proof nets and the call-by-value λ-calculus
Résumé
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 an isomorphism between the two systems: every single rewriting step on the calculus maps to a single step on proof 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 an unusual way, and identify a subcalculus that is shown to be as expressive as the full calculus.
Fichier principal
Accattoli - proof nets and the call-by-value lambda calculus (long version).pdf (571.16 Ko)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...