Computer Science – Logic in Computer Science
Scientific paper
2010-10-06
LMCS 6 (4:6) 2010
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-6(4:6)2010
Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. \Beta-reduction. Traditional presentations of interaction nets are based on graph theory and rely on elementary properties of graph theory. We give here a more explicit presentation based on notions borrowed from Girard's Geometry of Interaction: interaction nets are presented as partial permutations and a composition of nets, the gluing, is derived from the execution formula. We then define contexts and reduction as the context closure of rules. We prove strong confluence of the reduction within our framework and show how interaction nets can be viewed as the quotient of some generalized proof-nets.
No associations
LandOfFree
An Explicit Framework for Interaction Nets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Explicit Framework for Interaction Nets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Explicit Framework for Interaction Nets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-427287