On the Complexity of Set-Based Analysis

@inproceedings{Heintze1997OnTC,
  title={On the Complexity of Set-Based Analysis},
  author={Nevin Heintze and David A. McAllester},
  booktitle={ICFP},
  year={1997}
}
We define a general notion of set-based analysis --- any language whose operational semantics is defined by environment evaluation has a well defined set-based abstraction. This general definition covers both Aiken and Wimmers' type system and Heintze' set-based analysis. Aiken and Wimmers give a nondeterministic exponential time algorithm for their analysis. Heintze gives an O(n3) procedure. We show that this discrepancy is due to the complexity of the case statements analyzed. For polymorphic… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Towards a theory of types in prolog

  • P. Mishra
  • In International Symposium on Logic Programming,
  • 1984
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…