Is there a use for linear logic?

Past attempts to apply Girard’s linear logic have either had a clear relation to the theory (Lafont, Holmstr6m, Abramsky) or a clear practical value (Guzmiin 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.

[1]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[2]  Colin Runciman,et al.  Linearity and Laziness , 1991, FPCA.

[3]  Paul Hudak,et al.  Single-threaded polymorphic lambda calculus , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[4]  Philip Wadler,et al.  Linear Types can Change the World! , 1990, Programming Concepts and Methods.

[5]  Tsung-Min Kuo,et al.  Strictness analysis: a new perspective based on type inference , 1989, FPCA.

[6]  J. Girard,et al.  Proofs and types , 1989 .

[7]  Yves Lafont,et al.  The Linear Abstract Machine , 1988, Theor. Comput. Sci..

[8]  Paul Hudak.  A semantic model of reference counting and its abstraction (detailed summary) , 1986, LFP '86.

[9]  David A. Schmidt.  Detecting global variables in denotational specifications , 1985, TOPL.

[10]  John C. Mitchell,et al.  Coercion and type inference , 1984, POPL.

[11]  Robin Milner,et al.  Principal type-schemes for functional programs , 1982, POPL '82.

[12]  Robin Milner,et al.  A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[13]  John Darlington,et al.  A system which automatically improves programs , 1973, Acta Informatica.

[14]  R. Hindley.  The Principal Type-Scheme of an Object in Combinatory Logic , 1969 .

[15]  William A. Howard,et al.  The formulae-as-types notion of construction , 1969 .