![]() |
CiteULike | ![]() |
jacob's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Safe Polymorphic Type Inference for a Dynamically Typed Language: Translating Scheme to MLIn Proc. ACM Conf. on Functional Programming Languages and Computer Architecture ({FPCA}), La Jolla, California (1995)
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractWe describe a new method for polymorphic type inference for the dynamically typed language Scheme. The method infers both types and explicit run-time type operations (coercions) 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: ffl It is liberal in that no legal Scheme programs are "rejected " outright by the type...
BibTeX record
RIS record