I'm looking at a program analysis problem for ML-like languages where
I want to exploit type abstraction to improve the precision of a
standard 0-CFA type analysis. I was wondering if such analyses have
been previously studied and/or implemented? Any pointers would
appreciated. Thanks.
- John