Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

Type inference in context

Gundry, Adam and Mcbride, Conor and McKinna, James (2010) Type inference in context. In: MSFP '10 Proceedings of the third ACM SIGPLAN workshop on Mathematically structured functional programming. ACM, New York, NY, pp. 43-54. ISBN 978-1-4503-0255-5

Full text not available in this repository. (Request a copy from the Strathclyde author)

Abstract

We consider the problems of first-order unification and type inference from a general perspective on problem-solving, namely that of information increase in the problem context. This leads to a powerful technique for implementing type inference algorithms. We describe a unification algorithm and illustrate the technique for the familiar Hindley-Milner type system, but it can be applied to more advanced type systems. The algorithms depend on well-founded contexts: type variable bindings and type-schemes for terms may depend only on earlier bindings. We ensure that unification yields a most general unifier, and that type inference yields principal types, by advancing definitions earlier in the context only when necessary.

Item type: Book Section
ID code: 34660
Keywords: algorithms, theory, type inference, first-order unification, Electronic computers. Computer science
Subjects: Science > Mathematics > Electronic computers. Computer science
Department: Faculty of Science > Computer and Information Sciences
Related URLs:
Depositing user: Pure Administrator
Date Deposited: 09 Nov 2011 20:10
Last modified: 06 Sep 2014 07:31
URI: http://strathprints.strath.ac.uk/id/eprint/34660

Actions (login required)

View Item