Harry G. Mairson and Fritz Henglein. The complexity of type inference for higher-order typed lambda calculi. Journal of Functional Programming 4:4 (October 1994), pp. 435-478. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Optimality and Inefficiency : What Isn't a Cost Model of the.. - Lawall, Mairson (1996) (11 citations) Self-citation (Mairson) (Correct)
....paper) used for any term is the space cost. This metric can be realized (with polynomial slowdown for time, and constant expansion for space) on a Turing machine. More surprisingly, an arbitrary Turing machine can be simulated efficiently, using your favorite coding [FS91] essentially gives one; [HM94] gives another. The explanation of the efficiency of the simulation is simple: the simulation does not depend in any profound way on sharing. In an attempt to define a more parsimonious cost model, Frandsen and Sturtivant [FS91] proposed the following: the cost of a reduction to normal form is the ....
Harry G. Mairson and Fritz Henglein. The complexity of type inference for higher-order typed lambda calculi. Journal of Functional Programming 4:4 (October 1994), pp. 435-478.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC