A Calculus for Overload Functions with Subtyping

A Calculus for Overload Functions with Subtyping (1992)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by G. Castagna , G. Ghelli , G. Longo

Venue:
Citations:	131 - 28 self

Versions

Version History

Metadata Version 5

User correction supplied by mph

Datum	Value	Source
TITLE	A Calculus for Overload Functions with Subtyping	user correction - Legacy Corrections
AUTHOR NAME	G. Castagna	user correction
AUTHOR AFFIL	Laboratoire d'Informatique, URA 1327 du CNRS	user correction
AUTHOR NAME	G. Ghelli	user correction
AUTHOR AFFIL	Laboratoire d'Informatique, URA 1327 du CNRS	user correction
AUTHOR NAME	G. Longo	user correction
AUTHOR AFFIL	Laboratoire d'Informatique, URA 1327 du CNRS	user correction
ABSTRACT	We present a simple extension of typed -calculus where functions can be overloaded by putting different "branches of code" together. When the function is applied, the branch to execute is chosen according to a particular selection rule which depends on the type of the argument. The crucial feature of the present approach is that the branch selection depends on the "run-time type" of the argument, which may differ from its compile-time type, because of the existence of a subtyping relation among types. Hence overloading cannot be eliminated by a static analysis of code, but is an essential feature to be dealt with during computation. We obtain in this way a type-dependent calculus, which differs from the various -calculi where types do not play any role during computation. We prove Confluence and a generalized Subject-Reduction theorem for this calculus. We prove Strong Normalization for a "stratified" subcalculus. The definition of this calculus is guided by the understand...	user correction - Legacy Corrections
YEAR	1992	user correction
VENUE		user correction
VENUE TYPE		user correction
PAGES	182--192	INFERENCE
CITATIONS	35 found	ParsCit 1.0