Coherence for Sharing Proof-nets

Loading...
Thumbnail Image
Penn collection
IRCS Technical Reports Series
Degree type
Discipline
Subject
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Guerrini, Stefano
Martini, Simone
Masini, Andrea
Contributor
Abstract

Sharing graphs are an implementation of linear logic proofnets in such a way that their reduction never duplicate a redex. In their usual formulations, proof-nets present a problem of coherence: if the proof-net N reduces by standard cutelimination to N’, then, by reducing the sharing graph of N we do not obtain the sharing graph of N’. We solve this problem by changing the way the information is coded into sharing graphs and introducing a new reduction rule (absorption). The rewriting system is confluent and terminating. The proof of this fact exploits an algebraic semantics for sharing graphs.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
1997-03-01
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
University of Pennsylvania Institute for Research in Cognitive Science Technical Report No. IRCS-97-03.
Recommended citation
Collection