File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Row and Bounded Polymorphism via Disjoint Polymorphism

TitleRow and Bounded Polymorphism via Disjoint Polymorphism
Authors
KeywordsIntersection types
bounded polymorphism
row polymorphism
Issue Date2020
PublisherSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. The Journal's web site is located at hhttp://www.dagstuhl.de/publikationen/lipics/
Citation
The 34th European Conference on Object-Oriented Programming (ECOOP 2020), Virtual Conference, Berlin, Germany, 15-17 November 2020. In Hirschfeld, R & Pape, T (Eds.). LIPICS - Leibniz International Proceedings in Informatics, 2020, v. 166, article no. 27, p. 27:1-27:30 How to Cite?
AbstractPolymorphism and subtyping are important features in mainstream OO languages. The most common way to integrate the two is via 𝖥_{< :} style bounded quantification. A closely related mechanism is row polymorphism, which provides an alternative to subtyping, while still enabling many of the same applications. Yet another approach is to have type systems with intersection types and polymorphism. A recent addition to this design space are calculi with disjoint intersection types and disjoint polymorphism. With all these alternatives it is natural to wonder how they are related. This paper provides an answer to this question. We show that disjoint polymorphism can recover forms of both row polymorphism and bounded polymorphism, while retaining key desirable properties, such as type-safety and decidability. Furthermore, we identify the extra power of disjoint polymorphism which enables additional features that cannot be easily encoded in calculi with row polymorphism or bounded quantification alone. Ultimately we expect that our work is useful to inform language designers about the expressive power of those common features, and to simplify implementations and metatheory of feature-rich languages with polymorphism and subtyping.
Persistent Identifierhttp://hdl.handle.net/10722/301427
ISSN
2023 SCImago Journal Rankings: 0.796

 

DC FieldValueLanguage
dc.contributor.authorXie, N-
dc.contributor.authorDos Santos Oliveira, BC-
dc.contributor.authorBi, X-
dc.contributor.authorSchrijvers, T-
dc.date.accessioned2021-07-27T08:10:55Z-
dc.date.available2021-07-27T08:10:55Z-
dc.date.issued2020-
dc.identifier.citationThe 34th European Conference on Object-Oriented Programming (ECOOP 2020), Virtual Conference, Berlin, Germany, 15-17 November 2020. In Hirschfeld, R & Pape, T (Eds.). LIPICS - Leibniz International Proceedings in Informatics, 2020, v. 166, article no. 27, p. 27:1-27:30-
dc.identifier.issn1868-8969-
dc.identifier.urihttp://hdl.handle.net/10722/301427-
dc.description.abstractPolymorphism and subtyping are important features in mainstream OO languages. The most common way to integrate the two is via 𝖥_{< :} style bounded quantification. A closely related mechanism is row polymorphism, which provides an alternative to subtyping, while still enabling many of the same applications. Yet another approach is to have type systems with intersection types and polymorphism. A recent addition to this design space are calculi with disjoint intersection types and disjoint polymorphism. With all these alternatives it is natural to wonder how they are related. This paper provides an answer to this question. We show that disjoint polymorphism can recover forms of both row polymorphism and bounded polymorphism, while retaining key desirable properties, such as type-safety and decidability. Furthermore, we identify the extra power of disjoint polymorphism which enables additional features that cannot be easily encoded in calculi with row polymorphism or bounded quantification alone. Ultimately we expect that our work is useful to inform language designers about the expressive power of those common features, and to simplify implementations and metatheory of feature-rich languages with polymorphism and subtyping.-
dc.languageeng-
dc.publisherSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH. The Journal's web site is located at hhttp://www.dagstuhl.de/publikationen/lipics/-
dc.relation.ispartofLIPICS - Leibniz International Proceedings in Informatics-
dc.relation.ispartofThe 34th European Conference on Object-Oriented Programming (ECOOP 2020-
dc.rightsThis work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.-
dc.subjectIntersection types-
dc.subjectbounded polymorphism-
dc.subjectrow polymorphism-
dc.titleRow and Bounded Polymorphism via Disjoint Polymorphism-
dc.typeConference_Paper-
dc.identifier.emailDos Santos Oliveira, BC: bruno@cs.hku.hk-
dc.identifier.authorityDos Santos Oliveira, BC=rp01786-
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.4230/LIPIcs.ECOOP.2020.27-
dc.identifier.scopuseid_2-s2.0-85115257015-
dc.identifier.hkuros323738-
dc.identifier.volume166-
dc.identifier.spage27:1-
dc.identifier.epage27:30-
dc.publisher.placeGermany-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats