Computability in Europe 2008
Logic and Theory of Algorithms

Regular Talk:
On Extending Wand's Type Reconstruction Algorithm to Handle Polymorphic Let

Edit abstract data

Speaker:	Sunil Kothari
Author(s):	Sunil Kothari and James Caldwell
Slot:	Wed, 16:50-17:10, Room 19 (col. 5)

Abstract

This paper details an extension to Wand's  algorithm to handle the
polymorphic let construct. We have extended Wand's algorithm by extending
the constraint language and by using a multi-phase unification algorithm in the
constraint solving phase. This is the first detailed account for implementing
such an approach. We show the correctness of our approach by  extending the
Wand's soundness and completeness results. We have validated our approach
against other popular type reconstruction algorithms by  implementing OCaml
prototypes and running them on non-trivial examples.