Cited By
View all- Castagna GChen G(2001)Dependent Types with Subtyping and Late-Bound OverloadingInformation and Computation10.1006/inco.2001.3128168:1(1-67)Online publication date: 10-Jul-2001
We define the typed lambda calculus F^ω (F-omega-meet), a natural generalization of Girard's system Fω (F-omega) with intersection types and bounded polymorphism. A novel aspect of our presentation is the use of term rewriting techniques to present ...
Coercive subtyping is a useful and powerful framework of subtyping for type theories. The key idea of coercive subtyping is subtyping as abbreviation. In this paper, we give a new and adequate formulation of T[C], the system that extends a type theory T ...
The calculus of Dependent Object Types (DOT) has enabled a more principled and robust implementation of Scala, but its support for type-level computation has proven insufficient. As a remedy, we propose F··ω, a rigorous theoretical foundation for Scala’s ...
Springer-Verlag
Berlin, Heidelberg
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in