Once Upon a Type

A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a typeinference based program analysis which determines when values are accessed at most once. Our analysis can handle higher-order functions and data structures, and admits principal types for terms. Unlike previous analyses, we prove our analysis sound with respect to call-by-need reduction. Call-by-name reduction does not provide an accurate model of how often a value is used during lazy evaluation, since it duplicates work which would actually be shared in a real implementation. Our type system can easily be modified to analyse usage in a call-by-value language.

• Type: Conference
• Year: 1995
• Where: FPCA
• Authors: David N. Turner, Philip Wadler, Christian Mossin
• Keywords: Admits Principal Types, Analysis, FPCA 1995, Programming Languages, Typeinference Based Program