On the complexity of ML typability with overloading

We examine the complexity of type checking in an ML-style type system that permits functions to be overloaded with different types. In particular, we consider the extension of the ML type system proposed by Wadler and Blott in the appendix of [WB89], with global overloading only, that is, where the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Volpano, Dennis M., Smith, Geoffrey S.
Format: Buchkapitel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 28
container_issue
container_start_page 15
container_title
container_volume
creator Volpano, Dennis M.
Smith, Geoffrey S.
description We examine the complexity of type checking in an ML-style type system that permits functions to be overloaded with different types. In particular, we consider the extension of the ML type system proposed by Wadler and Blott in the appendix of [WB89], with global overloading only, that is, where the only overloading is that which exists in an initial type assumption set; no local overloading via over and inst expressions is allowed. It is shown that under a correct notion of well-typed terms, the problem of determining whether a term is well typed with respect to an assumption set in this system is undecidable. We then investigate limiting recursion in assumption sets, the source of the undecidability. Barring mutual recursion is considered, but this proves too weak, for the problem remains undecidable. Then we consider a limited form of recursion called parametric recursion. We show that although the problem becomes decidable under parametric recursion, it appears harder than conventional ML typability, which is complete for DEXPTIME [Mai90].
doi_str_mv 10.1007/3540543961_2
format Book Chapter
fullrecord <record><control><sourceid>springer</sourceid><recordid>TN_cdi_springer_books_10_1007_3540543961_2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>springer_books_10_1007_3540543961_2</sourcerecordid><originalsourceid>FETCH-LOGICAL-c271t-e109b836e92e379813ba2c4532b6226d5ef5e287e9b60f2dc0cc0d5b8674f8ba3</originalsourceid><addsrcrecordid>eNpNUE1LxDAUjF9gXXvzB-QsVF_ey0dzlMVVobIXPZcmTd1q3ZS2qPvv3aKgcxlmGGZgGLsQcCUAzDUpCUqS1aLEA3Y2S2mUtXDIEqGFyIikPWKpNflf9JglQICZNZJOWTqOr7AHIZHGhNF6y6dN4D6-9134aqcdjw1_LPi06yvXdrPx2U4bHj_C0MWqbrcv5-ykqboxpL-8YM-r26flfVas7x6WN0Xm0YgpCwKsy0kHi4GMzQW5Cr1UhE4j6lqFRgXMTbBOQ4O1B--hVi7XRja5q2jBLn96x37Yz4ahdDG-jaWAcr6j_H8HfQNjeUwB</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>On the complexity of ML typability with overloading</title><source>Springer Books</source><creator>Volpano, Dennis M. ; Smith, Geoffrey S.</creator><contributor>Hughes, John</contributor><creatorcontrib>Volpano, Dennis M. ; Smith, Geoffrey S. ; Hughes, John</creatorcontrib><description>We examine the complexity of type checking in an ML-style type system that permits functions to be overloaded with different types. In particular, we consider the extension of the ML type system proposed by Wadler and Blott in the appendix of [WB89], with global overloading only, that is, where the only overloading is that which exists in an initial type assumption set; no local overloading via over and inst expressions is allowed. It is shown that under a correct notion of well-typed terms, the problem of determining whether a term is well typed with respect to an assumption set in this system is undecidable. We then investigate limiting recursion in assumption sets, the source of the undecidability. Barring mutual recursion is considered, but this proves too weak, for the problem remains undecidable. Then we consider a limited form of recursion called parametric recursion. We show that although the problem becomes decidable under parametric recursion, it appears harder than conventional ML typability, which is complete for DEXPTIME [Mai90].</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540543961</identifier><identifier>ISBN: 3540543961</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540475990</identifier><identifier>EISBN: 9783540475996</identifier><identifier>DOI: 10.1007/3540543961_2</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><ispartof>Functional Programming Languages and Computer Architecture, 2005, p.15-28</ispartof><rights>Springer-Verlag Berlin Heidelberg 1991</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c271t-e109b836e92e379813ba2c4532b6226d5ef5e287e9b60f2dc0cc0d5b8674f8ba3</citedby><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3540543961_2$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3540543961_2$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>779,780,784,793,27925,38255,41442,42511</link.rule.ids></links><search><contributor>Hughes, John</contributor><creatorcontrib>Volpano, Dennis M.</creatorcontrib><creatorcontrib>Smith, Geoffrey S.</creatorcontrib><title>On the complexity of ML typability with overloading</title><title>Functional Programming Languages and Computer Architecture</title><description>We examine the complexity of type checking in an ML-style type system that permits functions to be overloaded with different types. In particular, we consider the extension of the ML type system proposed by Wadler and Blott in the appendix of [WB89], with global overloading only, that is, where the only overloading is that which exists in an initial type assumption set; no local overloading via over and inst expressions is allowed. It is shown that under a correct notion of well-typed terms, the problem of determining whether a term is well typed with respect to an assumption set in this system is undecidable. We then investigate limiting recursion in assumption sets, the source of the undecidability. Barring mutual recursion is considered, but this proves too weak, for the problem remains undecidable. Then we consider a limited form of recursion called parametric recursion. We show that although the problem becomes decidable under parametric recursion, it appears harder than conventional ML typability, which is complete for DEXPTIME [Mai90].</description><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540543961</isbn><isbn>3540543961</isbn><isbn>3540475990</isbn><isbn>9783540475996</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2005</creationdate><recordtype>book_chapter</recordtype><sourceid/><recordid>eNpNUE1LxDAUjF9gXXvzB-QsVF_ey0dzlMVVobIXPZcmTd1q3ZS2qPvv3aKgcxlmGGZgGLsQcCUAzDUpCUqS1aLEA3Y2S2mUtXDIEqGFyIikPWKpNflf9JglQICZNZJOWTqOr7AHIZHGhNF6y6dN4D6-9134aqcdjw1_LPi06yvXdrPx2U4bHj_C0MWqbrcv5-ykqboxpL-8YM-r26flfVas7x6WN0Xm0YgpCwKsy0kHi4GMzQW5Cr1UhE4j6lqFRgXMTbBOQ4O1B--hVi7XRja5q2jBLn96x37Yz4ahdDG-jaWAcr6j_H8HfQNjeUwB</recordid><startdate>20050706</startdate><enddate>20050706</enddate><creator>Volpano, Dennis M.</creator><creator>Smith, Geoffrey S.</creator><general>Springer Berlin Heidelberg</general><scope/></search><sort><creationdate>20050706</creationdate><title>On the complexity of ML typability with overloading</title><author>Volpano, Dennis M. ; Smith, Geoffrey S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c271t-e109b836e92e379813ba2c4532b6226d5ef5e287e9b60f2dc0cc0d5b8674f8ba3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2005</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Volpano, Dennis M.</creatorcontrib><creatorcontrib>Smith, Geoffrey S.</creatorcontrib></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Volpano, Dennis M.</au><au>Smith, Geoffrey S.</au><au>Hughes, John</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>On the complexity of ML typability with overloading</atitle><btitle>Functional Programming Languages and Computer Architecture</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2005-07-06</date><risdate>2005</risdate><spage>15</spage><epage>28</epage><pages>15-28</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540543961</isbn><isbn>3540543961</isbn><eisbn>3540475990</eisbn><eisbn>9783540475996</eisbn><abstract>We examine the complexity of type checking in an ML-style type system that permits functions to be overloaded with different types. In particular, we consider the extension of the ML type system proposed by Wadler and Blott in the appendix of [WB89], with global overloading only, that is, where the only overloading is that which exists in an initial type assumption set; no local overloading via over and inst expressions is allowed. It is shown that under a correct notion of well-typed terms, the problem of determining whether a term is well typed with respect to an assumption set in this system is undecidable. We then investigate limiting recursion in assumption sets, the source of the undecidability. Barring mutual recursion is considered, but this proves too weak, for the problem remains undecidable. Then we consider a limited form of recursion called parametric recursion. We show that although the problem becomes decidable under parametric recursion, it appears harder than conventional ML typability, which is complete for DEXPTIME [Mai90].</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/3540543961_2</doi><tpages>14</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Functional Programming Languages and Computer Architecture, 2005, p.15-28
issn 0302-9743
1611-3349
language eng
recordid cdi_springer_books_10_1007_3540543961_2
source Springer Books
title On the complexity of ML typability with overloading
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T21%3A30%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-springer&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=On%20the%20complexity%20of%20ML%20typability%20with%20overloading&rft.btitle=Functional%20Programming%20Languages%20and%20Computer%20Architecture&rft.au=Volpano,%20Dennis%20M.&rft.date=2005-07-06&rft.spage=15&rft.epage=28&rft.pages=15-28&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540543961&rft.isbn_list=3540543961&rft_id=info:doi/10.1007/3540543961_2&rft_dat=%3Cspringer%3Espringer_books_10_1007_3540543961_2%3C/springer%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540475990&rft.eisbn_list=9783540475996&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true