Linear Graph Reduction

The term for a variation on traditional graph reduction where the availability of references obeys a linear logic in its type. That is, only one object can refer to a specific expression/value unless a specific duplication combinator is used, in which case the outputs of the duplicator constitute two expressions with the same value in a sense.

About linear graph systems as object frameworks, see Alan Bawden's thesis.

This page is linked from: Sprint