S. Guerrini, S. Martini, A. Masini Dipartimento di Informatica, Universit`a ...  Home/Search
Context
Related
| daimi.aau.dk/~bra8130/...DIPISA26.ps.Z di.unipi.it/pub/Pa...pngarbcomp.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: daimi.aau.dk/~b...OMAPS_abstracts (more) From: ens.fr/~dicosmo/CourseNotes/Li... (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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. Keywords: linear logic; typed lambda-calculus; cut-elimination; sharing graphs; proof nets. 1 Introduction Cut-elimination (or normalization) is the... (Update)
Similar documents (at the sentence level):
76.4%: Proof nets, Garbage, and Computations - Guerrini Martini (Correct)
Active bibliography (related documents): More All
0.9: Coherence for Sharing Proof-Nets - Guerrini, Martini, Masini (1996) (Correct)
0.6: Modal Logic, Linear Logic, Optimal Lambda-Reduction - Guerrini, Martini, Masini (Correct)
0.4: Coherence for Sharing Proof-nets - Guerrini, Martini, Masini (1997) (Correct)
Similar documents based on text: More All
0.4: A Non-Commutative Extension of MELL - Guglielmi, Straßburger (2002) (Correct)
0.3: An Analysis of (Linear) Exponentials Based on Extended.. - Guerrini, Martini, Masini (1998) (Correct)
0.2: Non-commutativity and MELL in the Calculus of Structures - Guglielmi, Straßburger (2001) (Correct)
BibTeX entry: (Update)
@misc{ martini-proof,
author = "Guerrini Martini",
title = "Proof nets, Garbage, and Computations",
url = "citeseer.ist.psu.edu/9123.html" }
Citations (may not include all citations):215 Theoretical Computer Science (context) - Jean-Yves, logic - 1987
24 An algorithm for optimal lambda calculus reduction (context) - John - 1990
13 Linear logic without boxes - Georges, Mart'in et al. - 1992
11 Dipartimento di Informatica (context) - Stefano, Andrea et al. - 1996
8 Theoretical and Practical Issues of Optimal Implementations .. (context) - Stefano - 1996
7 comonads and optimal reductions (context) - Andrea, logic - 1995
5 Paths in the lambda-calculus: three years of communications .. (context) - Andrea, Vincent et al. - 1994
5 Sequent reconstruction in LLM---A sweepline proof (context) - Richard - 1995
3 R'eductions Correctes et Optimales dans le lambdacalcul (context) - L'ev, L'evy - 1978
3 Coherence for sharing proof-nets (context) - Stefano, Simone et al. - 1996
2 Interaction systems - Andrea, Cosimo - 1993
Documents on the same site (http://www.daimi.aau.dk/~bra8130/LOMAPS_abstracts.html): More
Enhanced Operational Semantics - Degano, Priami (1996) (Correct)
Clock Analysis of Synchronous Dataflow Programs - Jensen (1995) (Correct)
Proving Properties of Dynamic Process Networks - Dam (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC