Dependent types with subtyping and late-bound overloading

DOI10.1006/inco.2001.3128zbMath1007.68029OpenAlexW2036414952MaRDI QIDQ1854436

Gang Chen, Giuseppe Castagna

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2001.3128

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Semantic subtyping with an SMT solver

Uses Software

• ML
• CLOS
• Nuprl
• Automath
• Cecil

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• A semantics of multiple inheritance
• An extension of basic functionality theory for \(\lambda\)-calculus
• Typed operational semantics for higher-order subtyping.
• A calculus for overloaded functions with subtyping
• Integration of parametric and ``ad hoc second order polymorphism in a calculus with subtyping
• A filter lambda model and the completeness of type assignment
• A framework for defining logics
• Intensional interpretations of functionals of finite type I
• Tree-Manipulating Systems and Church-Rosser Theorems
• Subtyping dependent types

This page was built for publication: Dependent types with subtyping and late-bound overloading