Bakewell, Adam; Carlier, Sébastien; Kfoury, A. J.; Wells, J. B.
(Boston University Computer Science Department, 2005-12-30)
We present a procedure to infer a typing for an arbitrary λ-term M in an intersection-type system that translates into exactly the call-by-name (resp., call-by-value) evaluation of M. Our framework is the recently developed ...
