Safe polymorphic type inference for a dynamically typed language
Fritz Henglein, Jakob Rehof · 1995
We describe a new method for polymorphic type inference for the dynamically typed language Scheme. The method infers both types and explicit runtime type operations (coerc!ons) for a given program. It can be used to statically debug Scheme programs and to give a high-level translation to ML, in essence providing an “embedding” of Scheme into ML. Our method combines the following desirable properties: