Proof nets and the lambda-calculus

In Thomas Ehrhard (ed.), Linear logic in computer science. New York: Cambridge University Press. pp. 316--65 (2004)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A new correctness criterion for cyclic proof nets.V. Michele Abrusci & Elena Maringelli - 1998 - Journal of Logic, Language and Information 7 (4):449-459.
Linear logic in computer science.Thomas Ehrhard (ed.) - 2004 - New York: Cambridge University Press.
Interpolation in fragments of classical linear logic.Dirk Roorda - 1994 - Journal of Symbolic Logic 59 (2):419-444.
The Significance of the Curry-Howard Isomorphism.Richard Zach - 2019 - In Gabriele Mras, Paul Weingartner & Bernhard Ritter (eds.), Philosophy of Logic and Mathematics: Proceedings of the 41st International Ludwig Wittgenstein Symposium. Berlin, Boston: De Gruyter. pp. 313-326.

Analytics

Added to PP
2014-01-28

Downloads
51 (#304,672)

6 months
1 (#1,723,047)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

The structure of multiplicatives.Vincent Danos & Laurent Regnier - 1989 - Archive for Mathematical Logic 28 (3):181-203.

Add more references