Path: utzoo!news-server.csri.toronto.edu!cs.utexas.edu!usc!rpi!uupsi!sunic!news.funet.fi!hydra!cc.helsinki.fi!jpiitulainen
From: jpiitulainen@cc.helsinki.fi
Newsgroups: comp.lang.misc
Subject: Re: Dynamic typing (part 3)
Message-ID: <1991Mar17.161210.5574@cc.helsinki.fi>
Date: 17 Mar 91 16:12:10 GMT
References: <602@optima.cs.arizona.edu> <2400034@otter.hpl.hp.com>
Organization: University of Helsinki
Lines: 11

In article <2400034@otter.hpl.hp.com>, sfk@otter.hpl.hp.com (Steve Knight)
writes:
> One of the under-explored regions of this topic is that of heuristic type-
> checking for dynamically typed languages.  My belief is that this hybrid
> approach can be made effective enough to be useful.  I know the Scheme folks
> have made progress in this area but I've not kept up to date on it.

You might be interested in the following paper:
  Olin Shivers, "Data-Flow Analysis and Type Recovery in Scheme",
  March 30, 1990, CMU-CS-90-115, to appear in Peter Lee (ed.),
  _Topics in Advanced Language Implementation_, MIT Press