Lower bounds on type checking overloading
Smith has proposed an elegant extension of the ML type system for polymorphic functional languages with overloading. Type inference in his system requires solving a satisfiability problem that is undecidable if no restrictions are imposed on overloading. We explore the effect of recursion and the st...
Gespeichert in:
| Veröffentlicht in: | Information processing letters 1996-01, Vol.57 (1), p.9-13 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 13 |
|---|---|
| container_issue | 1 |
| container_start_page | 9 |
| container_title | Information processing letters |
| container_volume | 57 |
| creator | Volpano, Dennis M. |
| description | Smith has proposed an elegant extension of the
ML type system for polymorphic functional languages with overloading. Type inference in his system requires solving a satisfiability problem that is undecidable if no restrictions are imposed on overloading. We explore the effect of recursion and the structure of type assumptions in overloadings on the problem's complexity. |
| doi_str_mv | 10.1016/0020-0190(95)00184-0 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_237276010</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>0020019095001840</els_id><sourcerecordid>9217146</sourcerecordid><originalsourceid>FETCH-LOGICAL-c357t-28b4d28b6229199642e2f1507ddbb15d5354e10720cbc261ed49a2c67a7eb8563</originalsourceid><addsrcrecordid>eNp9kD9PwzAQxS0EEqXwDRgixECHwJ0T2_GChCr-SZVYYLYS-wIpJS52WtRvT0Krjix3N_zeO73H2DnCNQLKGwAOKaCGKy0mAFjkKRywERaKpxJRH7LRHjlmJzHOAUDmmRqxycz_UEgqv2pdTHybdJslJfaD7GfTvid-TWHhS9ffp-yoLheRznZ7zN4e7l-nT-ns5fF5ejdLbSZUl_Kiyl0_JOcatZY5J16jAOVcVaFwIhM5ISgOtrJcIrlcl9xKVSqqCiGzMbvY-i6D_15R7Mzcr0LbvzQ8U1xJQOihfAvZ4GMMVJtlaL7KsDEIZujEDIHNENhoYf46MYPscuddRlsu6lC2tol7LddSc4U9drvFqM-5biiYaBtqLbkmkO2M883_f34Bj1ByNA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>237276010</pqid></control><display><type>article</type><title>Lower bounds on type checking overloading</title><source>ScienceDirect Journals (5 years ago - present)</source><creator>Volpano, Dennis M.</creator><creatorcontrib>Volpano, Dennis M.</creatorcontrib><description>Smith has proposed an elegant extension of the
ML type system for polymorphic functional languages with overloading. Type inference in his system requires solving a satisfiability problem that is undecidable if no restrictions are imposed on overloading. We explore the effect of recursion and the structure of type assumptions in overloadings on the problem's complexity.</description><identifier>ISSN: 0020-0190</identifier><identifier>EISSN: 1872-6119</identifier><identifier>DOI: 10.1016/0020-0190(95)00184-0</identifier><identifier>CODEN: IFPLAT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Applied sciences ; Computational complexity ; Computer languages ; Computer programming ; Computer science; control theory; systems ; Exact sciences and technology ; Information processing ; Overloading ; Problem solving ; Programming theory ; Studies ; Theoretical computing ; Type theory</subject><ispartof>Information processing letters, 1996-01, Vol.57 (1), p.9-13</ispartof><rights>1996</rights><rights>1996 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Jan 15, 1996</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c357t-28b4d28b6229199642e2f1507ddbb15d5354e10720cbc261ed49a2c67a7eb8563</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/0020-0190(95)00184-0$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3548,27923,27924,45994</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2969271$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Volpano, Dennis M.</creatorcontrib><title>Lower bounds on type checking overloading</title><title>Information processing letters</title><description>Smith has proposed an elegant extension of the
ML type system for polymorphic functional languages with overloading. Type inference in his system requires solving a satisfiability problem that is undecidable if no restrictions are imposed on overloading. We explore the effect of recursion and the structure of type assumptions in overloadings on the problem's complexity.</description><subject>Applied sciences</subject><subject>Computational complexity</subject><subject>Computer languages</subject><subject>Computer programming</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Information processing</subject><subject>Overloading</subject><subject>Problem solving</subject><subject>Programming theory</subject><subject>Studies</subject><subject>Theoretical computing</subject><subject>Type theory</subject><issn>0020-0190</issn><issn>1872-6119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1996</creationdate><recordtype>article</recordtype><recordid>eNp9kD9PwzAQxS0EEqXwDRgixECHwJ0T2_GChCr-SZVYYLYS-wIpJS52WtRvT0Krjix3N_zeO73H2DnCNQLKGwAOKaCGKy0mAFjkKRywERaKpxJRH7LRHjlmJzHOAUDmmRqxycz_UEgqv2pdTHybdJslJfaD7GfTvid-TWHhS9ffp-yoLheRznZ7zN4e7l-nT-ns5fF5ejdLbSZUl_Kiyl0_JOcatZY5J16jAOVcVaFwIhM5ISgOtrJcIrlcl9xKVSqqCiGzMbvY-i6D_15R7Mzcr0LbvzQ8U1xJQOihfAvZ4GMMVJtlaL7KsDEIZujEDIHNENhoYf46MYPscuddRlsu6lC2tol7LddSc4U9drvFqM-5biiYaBtqLbkmkO2M883_f34Bj1ByNA</recordid><startdate>19960115</startdate><enddate>19960115</enddate><creator>Volpano, Dennis M.</creator><general>Elsevier B.V</general><general>Elsevier Science</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19960115</creationdate><title>Lower bounds on type checking overloading</title><author>Volpano, Dennis M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c357t-28b4d28b6229199642e2f1507ddbb15d5354e10720cbc261ed49a2c67a7eb8563</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1996</creationdate><topic>Applied sciences</topic><topic>Computational complexity</topic><topic>Computer languages</topic><topic>Computer programming</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Information processing</topic><topic>Overloading</topic><topic>Problem solving</topic><topic>Programming theory</topic><topic>Studies</topic><topic>Theoretical computing</topic><topic>Type theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Volpano, Dennis M.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Information processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Volpano, Dennis M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Lower bounds on type checking overloading</atitle><jtitle>Information processing letters</jtitle><date>1996-01-15</date><risdate>1996</risdate><volume>57</volume><issue>1</issue><spage>9</spage><epage>13</epage><pages>9-13</pages><issn>0020-0190</issn><eissn>1872-6119</eissn><coden>IFPLAT</coden><abstract>Smith has proposed an elegant extension of the
ML type system for polymorphic functional languages with overloading. Type inference in his system requires solving a satisfiability problem that is undecidable if no restrictions are imposed on overloading. We explore the effect of recursion and the structure of type assumptions in overloadings on the problem's complexity.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/0020-0190(95)00184-0</doi><tpages>5</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-0190 |
| ispartof | Information processing letters, 1996-01, Vol.57 (1), p.9-13 |
| issn | 0020-0190 1872-6119 |
| language | eng |
| recordid | cdi_proquest_journals_237276010 |
| source | ScienceDirect Journals (5 years ago - present) |
| subjects | Applied sciences Computational complexity Computer languages Computer programming Computer science control theory systems Exact sciences and technology Information processing Overloading Problem solving Programming theory Studies Theoretical computing Type theory |
| title | Lower bounds on type checking overloading |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T02%3A26%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Lower%20bounds%20on%20type%20checking%20overloading&rft.jtitle=Information%20processing%20letters&rft.au=Volpano,%20Dennis%20M.&rft.date=1996-01-15&rft.volume=57&rft.issue=1&rft.spage=9&rft.epage=13&rft.pages=9-13&rft.issn=0020-0190&rft.eissn=1872-6119&rft.coden=IFPLAT&rft_id=info:doi/10.1016/0020-0190(95)00184-0&rft_dat=%3Cproquest_cross%3E9217146%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=237276010&rft_id=info:pmid/&rft_els_id=0020019095001840&rfr_iscdi=true |