Safe polymorphic type inference for a dynamically typed language: translating Scheme to ML

@inproceedings{Henglein1995SafePT,
  title={Safe polymorphic type inference for a dynamically typed language: translating Scheme to ML},
  author={F. Henglein and J. Rehof},
  booktitle={FPCA '95},
  year={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: 
A practical soft type system for Scheme
Towards Practical Gradual Typing
Dynamic typing as staged type inference
Extending Dylan's type system for better type inference and error detection
The design and implementation of typed scheme
The Design and Implementation of Typed Scheme: From Scripts to Programs
Type Inference with Run-time Logs ( Work in Progress )
Gradual Typing for Objects
...
1
2
3
4
...