A resource aware semantics for a focused intuitionistic calculus
We investigate a new computational interpretation for an intuitionistic focused sequent calculus which is compatible with a resource aware semantics. For that, we associate to Herbelin's syntax a type system based on non-idempotent intersection types, together with a set of reduction rules – in...
Gespeichert in:
| Veröffentlicht in: | Mathematical structures in computer science 2019-01, Vol.29 (1), p.93-126 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 126 |
|---|---|
| container_issue | 1 |
| container_start_page | 93 |
| container_title | Mathematical structures in computer science |
| container_volume | 29 |
| creator | KESNER, DELIA VENTURA, DANIEL |
| description | We investigate a new computational interpretation for an intuitionistic focused sequent calculus which is compatible with a resource aware semantics. For that, we associate to Herbelin's syntax a type system based on non-idempotent intersection types, together with a set of reduction rules – inspired from the substitution at a distance paradigm – that preserves (and decreases the size of) typing derivations. The non-idempotent approach allows us to use very simple combinatorial arguments, only based on this measure decreasingness, to characterize linear-head and strongly normalizing terms by means of typability. For the sake of completeness, we also study typability (and the corresponding strong normalization characterization) in the calculus obtained from the former one by projecting the explicit cuts. |
| doi_str_mv | 10.1017/S0960129517000111 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2140862595</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cupid>10_1017_S0960129517000111</cupid><sourcerecordid>2140862595</sourcerecordid><originalsourceid>FETCH-LOGICAL-c317t-5ed71b86fd6093d3e9cf68290b90a6a8e1bf628a15d7363c2a3fed46c8df7d7b3</originalsourceid><addsrcrecordid>eNp1kM1LAzEQxYMoWKt_gLeA59WZpJuPm6VoFQoe1POSzYektLs12UX8701pwYN4mTm833szPEKuEW4RUN69ghaATNcoAQART8gEZ0JXCiQ7JZO9XO31c3KR87ogHEFPyP2cJp_7MVlPzZdJnma_Nd0QbaahT9SUacfsHY3dMMYh9l3MRaXWbOy4GfMlOQtmk_3VcU_J--PD2-KpWr0snxfzVWU5yqGqvZPYKhGcAM0d99oGoZiGVoMRRnlsg2DKYO0kF9wyw4N3M2GVC9LJlk_JzSF3l_rP0eehWZevu3KyYTgDJVit60LhgbKpzzn50OxS3Jr03SA0-6KaP0UVDz96zLZN0X343-j_XT98P2oe</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2140862595</pqid></control><display><type>article</type><title>A resource aware semantics for a focused intuitionistic calculus</title><source>Cambridge University Press Journals Complete</source><creator>KESNER, DELIA ; VENTURA, DANIEL</creator><creatorcontrib>KESNER, DELIA ; VENTURA, DANIEL</creatorcontrib><description>We investigate a new computational interpretation for an intuitionistic focused sequent calculus which is compatible with a resource aware semantics. For that, we associate to Herbelin's syntax a type system based on non-idempotent intersection types, together with a set of reduction rules – inspired from the substitution at a distance paradigm – that preserves (and decreases the size of) typing derivations. The non-idempotent approach allows us to use very simple combinatorial arguments, only based on this measure decreasingness, to characterize linear-head and strongly normalizing terms by means of typability. For the sake of completeness, we also study typability (and the corresponding strong normalization characterization) in the calculus obtained from the former one by projecting the explicit cuts.</description><identifier>ISSN: 0960-1295</identifier><identifier>EISSN: 1469-8072</identifier><identifier>DOI: 10.1017/S0960129517000111</identifier><language>eng</language><publisher>Cambridge, UK: Cambridge University Press</publisher><subject>Calculus ; Combinatorial analysis ; Normalizing ; Semantics</subject><ispartof>Mathematical structures in computer science, 2019-01, Vol.29 (1), p.93-126</ispartof><rights>Copyright © Cambridge University Press 2017</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c317t-5ed71b86fd6093d3e9cf68290b90a6a8e1bf628a15d7363c2a3fed46c8df7d7b3</citedby><cites>FETCH-LOGICAL-c317t-5ed71b86fd6093d3e9cf68290b90a6a8e1bf628a15d7363c2a3fed46c8df7d7b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.cambridge.org/core/product/identifier/S0960129517000111/type/journal_article$$EHTML$$P50$$Gcambridge$$H</linktohtml><link.rule.ids>164,314,776,780,27903,27904,55607</link.rule.ids></links><search><creatorcontrib>KESNER, DELIA</creatorcontrib><creatorcontrib>VENTURA, DANIEL</creatorcontrib><title>A resource aware semantics for a focused intuitionistic calculus</title><title>Mathematical structures in computer science</title><addtitle>Math. Struct. Comp. Sci</addtitle><description>We investigate a new computational interpretation for an intuitionistic focused sequent calculus which is compatible with a resource aware semantics. For that, we associate to Herbelin's syntax a type system based on non-idempotent intersection types, together with a set of reduction rules – inspired from the substitution at a distance paradigm – that preserves (and decreases the size of) typing derivations. The non-idempotent approach allows us to use very simple combinatorial arguments, only based on this measure decreasingness, to characterize linear-head and strongly normalizing terms by means of typability. For the sake of completeness, we also study typability (and the corresponding strong normalization characterization) in the calculus obtained from the former one by projecting the explicit cuts.</description><subject>Calculus</subject><subject>Combinatorial analysis</subject><subject>Normalizing</subject><subject>Semantics</subject><issn>0960-1295</issn><issn>1469-8072</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kM1LAzEQxYMoWKt_gLeA59WZpJuPm6VoFQoe1POSzYektLs12UX8701pwYN4mTm833szPEKuEW4RUN69ghaATNcoAQART8gEZ0JXCiQ7JZO9XO31c3KR87ogHEFPyP2cJp_7MVlPzZdJnma_Nd0QbaahT9SUacfsHY3dMMYh9l3MRaXWbOy4GfMlOQtmk_3VcU_J--PD2-KpWr0snxfzVWU5yqGqvZPYKhGcAM0d99oGoZiGVoMRRnlsg2DKYO0kF9wyw4N3M2GVC9LJlk_JzSF3l_rP0eehWZevu3KyYTgDJVit60LhgbKpzzn50OxS3Jr03SA0-6KaP0UVDz96zLZN0X343-j_XT98P2oe</recordid><startdate>201901</startdate><enddate>201901</enddate><creator>KESNER, DELIA</creator><creator>VENTURA, DANIEL</creator><general>Cambridge University Press</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>88I</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>201901</creationdate><title>A resource aware semantics for a focused intuitionistic calculus</title><author>KESNER, DELIA ; VENTURA, DANIEL</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c317t-5ed71b86fd6093d3e9cf68290b90a6a8e1bf628a15d7363c2a3fed46c8df7d7b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Calculus</topic><topic>Combinatorial analysis</topic><topic>Normalizing</topic><topic>Semantics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>KESNER, DELIA</creatorcontrib><creatorcontrib>VENTURA, DANIEL</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Engineering 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><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Mathematical structures in computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>KESNER, DELIA</au><au>VENTURA, DANIEL</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A resource aware semantics for a focused intuitionistic calculus</atitle><jtitle>Mathematical structures in computer science</jtitle><addtitle>Math. Struct. Comp. Sci</addtitle><date>2019-01</date><risdate>2019</risdate><volume>29</volume><issue>1</issue><spage>93</spage><epage>126</epage><pages>93-126</pages><issn>0960-1295</issn><eissn>1469-8072</eissn><abstract>We investigate a new computational interpretation for an intuitionistic focused sequent calculus which is compatible with a resource aware semantics. For that, we associate to Herbelin's syntax a type system based on non-idempotent intersection types, together with a set of reduction rules – inspired from the substitution at a distance paradigm – that preserves (and decreases the size of) typing derivations. The non-idempotent approach allows us to use very simple combinatorial arguments, only based on this measure decreasingness, to characterize linear-head and strongly normalizing terms by means of typability. For the sake of completeness, we also study typability (and the corresponding strong normalization characterization) in the calculus obtained from the former one by projecting the explicit cuts.</abstract><cop>Cambridge, UK</cop><pub>Cambridge University Press</pub><doi>10.1017/S0960129517000111</doi><tpages>34</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0960-1295 |
| ispartof | Mathematical structures in computer science, 2019-01, Vol.29 (1), p.93-126 |
| issn | 0960-1295 1469-8072 |
| language | eng |
| recordid | cdi_proquest_journals_2140862595 |
| source | Cambridge University Press Journals Complete |
| subjects | Calculus Combinatorial analysis Normalizing Semantics |
| title | A resource aware semantics for a focused intuitionistic calculus |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T06%3A33%3A27IST&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=A%20resource%20aware%20semantics%20for%20a%20focused%20intuitionistic%20calculus&rft.jtitle=Mathematical%20structures%20in%20computer%20science&rft.au=KESNER,%20DELIA&rft.date=2019-01&rft.volume=29&rft.issue=1&rft.spage=93&rft.epage=126&rft.pages=93-126&rft.issn=0960-1295&rft.eissn=1469-8072&rft_id=info:doi/10.1017/S0960129517000111&rft_dat=%3Cproquest_cross%3E2140862595%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=2140862595&rft_id=info:pmid/&rft_cupid=10_1017_S0960129517000111&rfr_iscdi=true |