Dependent types with subtyping and late-bound overloading
From MaRDI portal
Recommendations
Cites work
- A calculus for overloaded functions with subtyping
- A filter lambda model and the completeness of type assignment
- A framework for defining logics
- A module calculus for pure type systems
- A semantics of multiple inheritance
- An extension of basic functionality theory for -calculus
- Coercive subtyping in type theory
- scientific article; zbMATH DE number 4055576 (Why is no real title available?)
- scientific article; zbMATH DE number 512775 (Why is no real title available?)
- scientific article; zbMATH DE number 512778 (Why is no real title available?)
- Integration of parametric and ``ad hoc second order polymorphism in a calculus with subtyping
- Intensional interpretations of functionals of finite type I
- Object oriented programming. A unified foundation
- Pure type systems with subtyping. (Extended abstract)
- Subtyping calculus of construction. (Extended abstract)
- Subtyping dependent types
- Subtyping with singleton types
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Tree-Manipulating Systems and Church-Rosser Theorems
- Typed operational semantics for higher-order subtyping.
Cited in
(6)
This page was built for publication: Dependent types with subtyping and late-bound overloading
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854436)