Abstract

Linear types (types of values that can be used just once) have been drawing a great deal of attention because they are useful for memory management, in-place update of data structures, etc.: an obvious advantage is that a value of a linear type can be immediately deallocated after being used. However, the linear types have not been applied so widely in practice, probably because linear values (values of linear types) in the traditional sense do not so often appear in actual programs. In order to increase the applicability of linear types, we relax the condition of linearity by extending the types with information on an evaluation order and simple dataflow information. The extended type system, called a quasi-linear type system, is formalized and its correctness is proved. We have implemented a prototype type inference system for the core-ML that can automatically find out which value is linear in the relaxed sense. Promising results were obtained from preliminary experiments with the p...

Citations

573	The Definition of Standard ML (Revised - Milner, Tofte, et al. - 1997
119	Linearity and the Pi-Calculus - Kobayashi, Pierce, et al. - 1999
97	Compiling with Types - Morrisett - 1995
91	linear Lisp – ’Look Ma, no garbage - Baker, Lively - 1992
89	Abstract models of memory management - Morrisett, Felleisen, et al. - 1995
86	From region inference to von Neumann machines via region representation inference - Birkedal, Tofte, et al. - 1996
77	Once upon a type - Turner, Wadler, et al. - 1995
71	Single-threaded polymorphic lambda calculus - Guzman, Hudak - 1990
70	A partially deadlock-free type process calculus. Pages 128–139 of - Kobayashi - 1997
67	Conventional and uniqueness typing in graph rewrite systems (extended abstract - Barendsen, Smetsers - 1993
65	Tag-free garbage collection using explicit type parameters - Tolmach - 1994
44	LiLac: a functional programming language based on Linear Logic - Mackie - 1993
33	The ML Kit version 1 - Birkedal, Rothwell, et al. - 1993
28	Implementing the call-by-value lambda-calculus using a stack of regions - Tofte, Talpin - 1994
22	Observers for linear types - Odersky - 1992
8	Type-Based Analysis of Usage of Communication Channels for Concurrent Programming Languages - Igarashi, Kobayashi - 1997
7	A ’Linear Logic’ quicksort - Baker - 1994
5	Type-based analysis of usage of values for concurrent programming languages - Igarashi - 1997
1	Eekelen. Concurrent Clean ver.1.3 language report - Plasmeijer, van - 1997
1	Barendsen and Sjaak Smetsers. Conventional and uniqueness typing in graph rewrite systems - Erik - 1993