A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We present a monovariant flow analysis for System F (with recursion). The flow analysis yields both control-flow information, approximating the λ-and Λ-expressions that may be bound to variables, and type-flow information, approximating the type expressions that may instantiate type variables. Moreover, the two flows are mutually beneficial: the control flow determines which Λ-expressions may be applied to which type expressions (and, hence, which type expressions may instantiate which typedoi:10.1007/978-3-642-41582-1_8 fatcat:djdtvghd2vbl7kd4n4bmwpnjpe