Idioma:

On subtyping and matching

ABADI, M ; CARDELLI, L

ACM transactions on programming languages and systems, 1996-07, Vol.18 (4), p.401-423 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
On subtyping and matching
Autor: ABADI, M ; CARDELLI, L
Assuntos: Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Programming languages ; Software
É parte de: ACM transactions on programming languages and systems, 1996-07, Vol.18 (4), p.401-423
Notas: ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
Descrição: A relation between recursive object types, called matching , has been proposed as a generalization of subtyping. Unlike subtyping, matching does not support subsumption, but it does support inheritance of binary methods. We argue that matching is a good idea, but that it should not be regarded as a form of F-bounded subtyping (as was originally intended). We show that a new interpretation of matching as higher-order subtyping has better properties. Matching turns out to be a third-order construction, possibly the only one to have been proposed for general use in programming.
Editor: New York, NY: Association for Computing Machinery
Idioma: Inglês

Links

Voltar para lista de resultados

Anterior Resultado 2 Avançar Ir para próxima página