Skip to main content
Conference Proceedings

Proof nets, garbage, and computations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1210 181-195
DOI: 10.1007/3-540-62688-3_36
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study the problem of local and asynchronous computation in the context of multiplicative exponential linear logic (MELL) proof nets. The main novelty is in a complete set of rewriting rules for cut-elimination in presence of weakening (which requires garbage collection). The proposed reduction system is strongly normalizing and confluent.

Author supplied keywords

Cite

CITATION STYLE

APA

Guerrini, S., Martini, S., & Masini, A. (1997). Proof nets, garbage, and computations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1210, pp. 181–195). Springer Verlag. https://doi.org/10.1007/3-540-62688-3_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free