A Feasible Algorithm for Typing in Elementary Affine Logic
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type system we consider (denoted EAL*) is a variant where sharing i...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 70 |
|---|---|
| container_issue | |
| container_start_page | 55 |
| container_title | |
| container_volume | |
| creator | Baillot, Patrick Terui, Kazushige |
| description | We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type system we consider (denoted EAL*) is a variant where sharing is restricted to variables and without polymorphism. Our algorithm improves over the ones already known in that it offers a better complexity bound: if a simple type derivation for the term t is given our algorithm performs EAL* type inference in polynomial time in the size of the derivation. |
| doi_str_mv | 10.1007/11417170_6 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17027603</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17027603</sourcerecordid><originalsourceid>FETCH-LOGICAL-j284t-c4826d79d51459f70549cee55357a3d4675cd9744c83cc6832ba11069fb6b6d23</originalsourceid><addsrcrecordid>eNpFkL1OwzAYRc2fRFtYeAIvSCyB7_NvzBZVFJAqsZTZchw7uKRJFXfp2xNUJKY7nKurq0PIHcIjAugnRIEaNVh1RuZcCuAMUJTnZIYKseBcmIsTYFIajpdkBhxYYbTg12Se8xYAmDZsRp4rugoup7oLtOraYUyHrx2Nw0g3x33qW5p6-tKFXegPbjzSKsbUB7oe2uRvyFV0XQ63f7kgn6uXzfKtWH-8vi-rdbFlpTgUXpRMNdo0EoU0UYMUxocgJZfa8UYoLX0zPRO-5N6rkrPaIYIysVa1ahhfkPvT7t5l77o4ut6nbPdj2k2X7OSBaQV86j2cenlCfRtGWw_Dd7YI9tea_bfGfwCEgVeU</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Feasible Algorithm for Typing in Elementary Affine Logic</title><source>Springer Books</source><creator>Baillot, Patrick ; Terui, Kazushige</creator><contributor>Urzyczyn, Paweł</contributor><creatorcontrib>Baillot, Patrick ; Terui, Kazushige ; Urzyczyn, Paweł</creatorcontrib><description>We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type system we consider (denoted EAL*) is a variant where sharing is restricted to variables and without polymorphism. Our algorithm improves over the ones already known in that it offers a better complexity bound: if a simple type derivation for the term t is given our algorithm performs EAL* type inference in polynomial time in the size of the derivation.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540255931</identifier><identifier>ISBN: 9783540255932</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540320148</identifier><identifier>EISBN: 9783540320142</identifier><identifier>DOI: 10.1007/11417170_6</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Theoretical computing</subject><ispartof>Lecture notes in computer science, 2005, p.55-70</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11417170_6$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11417170_6$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17027603$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Urzyczyn, Paweł</contributor><creatorcontrib>Baillot, Patrick</creatorcontrib><creatorcontrib>Terui, Kazushige</creatorcontrib><title>A Feasible Algorithm for Typing in Elementary Affine Logic</title><title>Lecture notes in computer science</title><description>We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type system we consider (denoted EAL*) is a variant where sharing is restricted to variables and without polymorphism. Our algorithm improves over the ones already known in that it offers a better complexity bound: if a simple type derivation for the term t is given our algorithm performs EAL* type inference in polynomial time in the size of the derivation.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540255931</isbn><isbn>9783540255932</isbn><isbn>3540320148</isbn><isbn>9783540320142</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpFkL1OwzAYRc2fRFtYeAIvSCyB7_NvzBZVFJAqsZTZchw7uKRJFXfp2xNUJKY7nKurq0PIHcIjAugnRIEaNVh1RuZcCuAMUJTnZIYKseBcmIsTYFIajpdkBhxYYbTg12Se8xYAmDZsRp4rugoup7oLtOraYUyHrx2Nw0g3x33qW5p6-tKFXegPbjzSKsbUB7oe2uRvyFV0XQ63f7kgn6uXzfKtWH-8vi-rdbFlpTgUXpRMNdo0EoU0UYMUxocgJZfa8UYoLX0zPRO-5N6rkrPaIYIysVa1ahhfkPvT7t5l77o4ut6nbPdj2k2X7OSBaQV86j2cenlCfRtGWw_Dd7YI9tea_bfGfwCEgVeU</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Baillot, Patrick</creator><creator>Terui, Kazushige</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>A Feasible Algorithm for Typing in Elementary Affine Logic</title><author>Baillot, Patrick ; Terui, Kazushige</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-j284t-c4826d79d51459f70549cee55357a3d4675cd9744c83cc6832ba11069fb6b6d23</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Baillot, Patrick</creatorcontrib><creatorcontrib>Terui, Kazushige</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Baillot, Patrick</au><au>Terui, Kazushige</au><au>Urzyczyn, Paweł</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Feasible Algorithm for Typing in Elementary Affine Logic</atitle><btitle>Lecture notes in computer science</btitle><date>2005</date><risdate>2005</risdate><spage>55</spage><epage>70</epage><pages>55-70</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540255931</isbn><isbn>9783540255932</isbn><eisbn>3540320148</eisbn><eisbn>9783540320142</eisbn><abstract>We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type system we consider (denoted EAL*) is a variant where sharing is restricted to variables and without polymorphism. Our algorithm improves over the ones already known in that it offers a better complexity bound: if a simple type derivation for the term t is given our algorithm performs EAL* type inference in polynomial time in the size of the derivation.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11417170_6</doi><tpages>16</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2005, p.55-70 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17027603 |
| source | Springer Books |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Theoretical computing |
| title | A Feasible Algorithm for Typing in Elementary Affine Logic |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T14%3A32%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20Feasible%20Algorithm%20for%20Typing%20in%20Elementary%20Affine%20Logic&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Baillot,%20Patrick&rft.date=2005&rft.spage=55&rft.epage=70&rft.pages=55-70&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540255931&rft.isbn_list=9783540255932&rft_id=info:doi/10.1007/11417170_6&rft_dat=%3Cpascalfrancis_sprin%3E17027603%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540320148&rft.eisbn_list=9783540320142&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |