Treffer: On subtyping and matching
Title:
On subtyping and matching
Authors:
Source:
ACM transactions on programming languages and systems. 18(4):401-423
Publisher Information:
New York, NY: Association for Computing Machinery, 1996.
Publication Year:
1996
Physical Description:
print, 1 p.1/2
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Langages de programmation, Programming languages, Adaptation, Adaptación, Langage programmation, Programming language, Lenguaje programación, Orienté objet, Object oriented, Orientado objeto, Système binaire, Binary system, Sistema binario, Technique programmation, Programmation technique, Técnica programación, Type, Tipo, F-bounded, Subtyping, Type operator, Type theory
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Digital Equipement Corporation, United States
ISSN:
0164-0925
Rights:
Copyright 1996 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.3186935
Database:
PASCAL Archive
Weitere Informationen
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.