Strict intersection types for the Lambda Calculus

@article{Bakel2011StrictIT,
  title={Strict intersection types for the Lambda Calculus},
  author={Steffen van Bakel},
  journal={ACM Comput. Surv.},
  year={2011},
  volume={43},
  pages={20:1-20:49}
}
This article will show the usefulness and elegance of strict intersection types for the Lambda Calculus, that are strict in the sense that they are the representatives of equivalence classes of types in the BCD-system [Barendregt et al. 1983]. We will focus on the essential intersection type assignment; this system is almost syntax directed, and we will show that all major properties hold that are known to hold for other intersection systems, like the approximation theorem, the characterization… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
24 Citations
12 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Principal type schemes and λ-calculus semantics

  • M. Coppo, M. Dezani-Ciancaglini, B. Venneri
  • J.R. Hindley and J.P. Seldin, editors, To H.B…
  • 1980
Highly Influential
11 Excerpts

The Lambda Calculus: its Syntax and Semantics

  • H. Barendregt
  • North-Holland, Amsterdam, revised edition,
  • 1984
Highly Influential
9 Excerpts

Preliminary design of the programming language Forsythe

  • J. C. Reynolds
  • Technical Report CMU-CS-88-159, Carnegie Mellon…
  • 1988
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…