Types as Abstract Interpretations

@inproceedings{Cousot1997TypesAA,
  title={Types as Abstract Interpretations},
  author={Patrick Cousot},
  booktitle={POPL},
  year={1997}
}
Starting from a denotational semantics of the eager untyped lambda-calculus with explicit runtime errors, the standard collecting semantics is defined as specifying the strongest program properties. By a first abstraction, a new sound type collecting semantics is derived in compositional fix-point form. Then by successive (semi-dual) Galois connection based abstractions, type systems and/or type inference algorithms are designed as abstract semantics or abstract interpreters approximating the… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 206 citations. REVIEW CITATIONS
133 Citations
6 References
Similar Papers

Citations

Publications citing this paper.

206 Citations

01020'96'01'07'13
Citations per Year
Semantic Scholar estimates that this publication has 206 citations based on the available data.

See our FAQ for additional information.

References

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

Lambda calculi with types

  • H. Barendregt
  • Vol. 2 of Handbook of Logic in Computer Science…
  • 1992
Highly Influential
10 Excerpts

A theory of polymorphism in programming

  • R. Milner
  • J. Comput. Sys. Sci., 17(3):348–375
  • 1978
Highly Influential
10 Excerpts

Semantic foundations of program analysis

  • P. Cousot
  • Ch. 10 of Program Flow Analysis: Theory and…
  • 1981
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…