## Efficient Type Inference for Higher-Order Binding-Time Analysis (1991)

### Cached

### Download Links

- [repository.readscheme.org]
- [www.diku.dk]
- [ftp.diku.dk]
- DBLP

### Other Repositories/Bibliography

Venue: | In Functional Programming and Computer Architecture |

Citations: | 91 - 4 self |

### BibTeX

@INPROCEEDINGS{Henglein91efficienttype,

author = {Fritz Henglein},

title = {Efficient Type Inference for Higher-Order Binding-Time Analysis},

booktitle = {In Functional Programming and Computer Architecture},

year = {1991},

pages = {448--472},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

Binding-time analysis determines when variables and expressions in a program can be bound to their values, distinguishing between early (compile-time) and late (run-time) binding. Binding-time information can be used by compilers to produce more efficient target programs by partially evaluating programs at compile-time. Binding-time analysis has been formulated in abstract interpretation contexts and more recently in a type-theoretic setting. In a type-theoretic setting binding-time analysis is a type inference problem: the problem of inferring a completion of a λ-term e with binding-time annotations such that e satisfies the typing rules. Nielson and Nielson and Schmidt have shown that every simply typed λ-term has a unique completion ê that minimizes late binding in TML, a monomorphic type system with explicit binding-time annotations, and they present exponential time algorithms for computing such minimal completions. 1 Gomard proves the same results for a variant of his two-level λ-calculus without a so-called “lifting ” rule. He presents another algorithm for inferring completions in this somewhat restricted type system and states that it can be implemented in time O(n 3). He conjectures that the completions computed are minimal.