A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Type inference with expansion variables and intersection types in system E and an exact correspondence with β-reduction
2004
Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '04
System E is a recently designed type system for the λcalculus with intersection types and expansion variables. During automatic type inference, expansion variables allow postponing decisions about which non-syntax-driven typing rules to use until the right information is available and allow implementing the choices via substitution. This paper uses expansion variables in a unification-based automatic type inference algorithm for System E that succeeds for every β-normalizable λ-term. We have
doi:10.1145/1013963.1013980
dblp:conf/ppdp/CarlierW04
fatcat:4geahdiobzcopgz4oqwm5jnfty