## Inferring Recursive Data Types (0)

Citations: | 5 - 0 self |

### BibTeX

@TECHREPORT{Mcallester_inferringrecursive,

author = {David Mcallester},

title = {Inferring Recursive Data Types},

institution = {},

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

. This paper contains five results on the problem of inferring types. The first is that type inference over recursive types with unions and data constructors can be done in cubic time using a flow analysis. The second is a general theorem characterizing the time complexity of bottom-up logic programs. The O(n 3 ) running time of the flow analysis is a corollary of this bottom-up run time theorem. The third is that for shallow case statements typability by the semantic types of Aiken, Wimmers and Lakshman is equivalent to typability by recursive types and hence can be determined by flow analysis. The fourth is that, even for first order programs of arity one, typability by recursive types is PSPACE hard for polymorphic programs. The final result is that for any fixed bound on order and arity Hindley-Milner typability can be determined in pseudo-linear time, i.e., O(nff(n)) where ff is the inverse Ackerman function. The last two results suggest that let-polymorphism over s...