Work

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

Year: 2013

Type: article

Abstract: 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 an unusual way.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.113.5

Author: Beniamino Accattoli

Institutions: Institut national de recherche en sciences et technologies du numérique, École Polytechnique

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2061036436

FWCI: 2.195

Cites: 21

Cited by: 9

Related to: