Enhanced type inference for binding-time analysis

Abstract

In this paper we will be taking a look at type inference and its uses for binding-time analysis, dynamic typing and better error messages. We will propose a new binding-time analysis algorithm ℬ, which is a modification of an already existing algorithm by Gomard [4], and discuss the speed difference.

Keywords

• type inference
• dynamic typing
• binding-time analysis
• partial evaluation
• functional languages
• 68n18
• 68n15
• 03b38