Abstract

Past attempts to apply Girard's linear logic have either had a clear relation to the theory (Lafont, Holmstrom, Abramsky) or a clear practical value (Guzm'an and Hudak, Wadler), but not both. This paper defines a sequence of languages based on linear logic that span the gap between theory and practice. Type reconstruction in a linear type system can derive information about sharing. An approach to linear type reconstruction based on use types is presented. Applications to the array update problem are considered.

Citations

874	A theory of type polymorphism in programming - Milner - 1978
395	The formulae-as-types notion of construction - Howard - 1980
325	Proofs and Types - Girard, Lafont, et al. - 1989
272	Computational interpretations of linear logic - Abramsky - 1993
221	Principal type schemes for functional programs - Damas, Milner - 1982
122	Linear types can change the world - Wadler - 1990
98	The principal type scheme of an object in combinatory logic - Hindley - 1969
89	The linear abstract machine - Lafont - 1988
71	Single-threaded polymorphic lambda calculus - Guzman, Hudak - 1990
65	Coercion and type inference - Mitchell - 1984
64	A semantic model of reference counting and its abstraction - Hudak - 1986
56	Detecting global variables in denotational specifications - Schmidt - 1985
53	Strictness Analysis: A New Perspective Based on Type Inference - Tsung-Min, Mishra - 1989
50	A system which automatically improves programs - DARLINGTON, BURSTALL - 1976
19	A linear functional language - Holmstrom - 1988
17	Linearity and laziness - Wakeling, Runciman - 1991
6	Path analysis: using order-of-evaluation information to optimize lazy functional languages - Bloss - 1989
1	Extending Curry and ML type inference with subtypes - Mitchell - 1991
1	Strictness analysis via type inference - Wright - 1989