Conventional and Uniqueness Typing in Graph Rewrite Systems
Erik Barendsen, J.E.W. Smetsers · 1993
In this paper we describe a Curry-like type system for graphs and extend it with uniqueness information to indicate that certain objects are only `locally accessible'. The correctness of type assignment guarantees that no external access on such an object will take place in the future. We prove that types are preserved under reduction (for both type systems) for a large class of rewrite systems. Adding uniqueness information provides a solution to two problems in implementations of functional languages: efficient space management and interfacing with nonfunctional operations. AMS Classification (1991): 68Q42 (68Q05). CR Classification (1991): F.4.2, D.3.3 (D.3.1, D.1.1, F.4.1). Keywords and phrases: graph rewrite systems, functional programming languages, typing, higher order functions, uniqueness typing, algebraic types, linear typing, destructive updates. 1. Introduction There are several models of computation that can be viewed as a basis for functional programming. Traditional...