<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of inria-00110245</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-09T01:08:44+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="it">Quasi-friendly sup-interpretations</title>
            <author role="aut">
              <persName>
                <forename type="first">Jean-Yves</forename>
                <surname>Marion</surname>
              </persName>
              <email type="md5">6773340d4dbea528bffc0b04a51eed2a</email>
              <email type="domain">LORIA.FR</email>
              <idno type="idhal" notation="string">jean-yves-marion</idno>
              <idno type="idhal" notation="numeric">12646</idno>
              <idno type="halauthorid" notation="string">2548208-12646</idno>
              <idno type="IDREF">https://www.idref.fr/075874849</idno>
              <idno type="ORCID">https://orcid.org/0009-0002-8262-3887</idno>
              <orgName ref="#struct-300293"/>
              <affiliation ref="#struct-2347"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Romain</forename>
                <surname>Péchoux</surname>
              </persName>
              <email type="md5">ccee1bec168815dd926f2c4151ffbf6c</email>
              <email type="domain">loria.fr</email>
              <idno type="idhal" notation="string">romain-pechoux</idno>
              <idno type="idhal" notation="numeric">830994</idno>
              <idno type="halauthorid" notation="string">117596-830994</idno>
              <idno type="IDREF">https://www.idref.fr/131003232</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-0601-5425</idno>
              <orgName ref="#struct-300293"/>
              <affiliation ref="#struct-2347"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Romain</forename>
                <surname>Péchoux</surname>
              </persName>
              <email type="md5">ccee1bec168815dd926f2c4151ffbf6c</email>
              <email type="domain">loria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2006-10-26 21:29:57</date>
              <date type="whenModified">2025-11-04 11:58:20</date>
              <date type="whenReleased">2006-10-30 18:01:59</date>
              <date type="whenProduced">2006-08-10</date>
              <date type="whenEndEmbargoed">2006-10-26</date>
              <ref type="file" target="https://inria.hal.science/inria-00110245v1/document">
                <date notBefore="2006-10-26"/>
              </ref>
              <ref type="file" n="1" target="https://inria.hal.science/inria-00110245v1/file/lcc2006.pdf" id="file-110245-61101">
                <date notBefore="2006-10-26"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="103950">
                <persName>
                  <forename>Romain</forename>
                  <surname>Péchoux</surname>
                </persName>
                <email type="md5">ccee1bec168815dd926f2c4151ffbf6c</email>
                <email type="domain">loria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">inria-00110245</idno>
            <idno type="halUri">https://inria.hal.science/inria-00110245</idno>
            <idno type="halBibtex">marion:inria-00110245</idno>
            <idno type="halRefHtml">&lt;i&gt;8th International Workshop on Logic and Computational Complexity - LCC 2006 - LICS affiliated Workshop&lt;/i&gt;, James Royer, Aug 2006, Seattle/Etats-Unis</idno>
            <idno type="halRef">8th International Workshop on Logic and Computational Complexity - LCC 2006 - LICS affiliated Workshop, James Royer, Aug 2006, Seattle/Etats-Unis</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-110245-61101"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
            <idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
            <idno type="stamp" n="LORIA2">Publications du LORIA</idno>
            <idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="LORIA">Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
            <idno type="stamp" n="AM2I-UL">Pôle scientifique Automatique, Mathématiques, Informatique et leurs Intéractions de l'Université de Lorraine</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="1">Not set</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="it">Quasi-friendly sup-interpretations</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Jean-Yves</forename>
                    <surname>Marion</surname>
                  </persName>
                  <email type="md5">6773340d4dbea528bffc0b04a51eed2a</email>
                  <email type="domain">LORIA.FR</email>
                  <idno type="idhal" notation="string">jean-yves-marion</idno>
                  <idno type="idhal" notation="numeric">12646</idno>
                  <idno type="halauthorid" notation="string">2548208-12646</idno>
                  <idno type="IDREF">https://www.idref.fr/075874849</idno>
                  <idno type="ORCID">https://orcid.org/0009-0002-8262-3887</idno>
                  <orgName ref="#struct-300293"/>
                  <affiliation ref="#struct-2347"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Romain</forename>
                    <surname>Péchoux</surname>
                  </persName>
                  <email type="md5">ccee1bec168815dd926f2c4151ffbf6c</email>
                  <email type="domain">loria.fr</email>
                  <idno type="idhal" notation="string">romain-pechoux</idno>
                  <idno type="idhal" notation="numeric">830994</idno>
                  <idno type="halauthorid" notation="string">117596-830994</idno>
                  <idno type="IDREF">https://www.idref.fr/131003232</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-0601-5425</idno>
                  <orgName ref="#struct-300293"/>
                  <affiliation ref="#struct-2347"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>8th International Workshop on Logic and Computational Complexity - LCC 2006 - LICS affiliated Workshop</title>
                  <date type="start">2006-08-10</date>
                  <settlement>Seattle/Etats-Unis</settlement>
                </meeting>
                <respStmt>
                  <resp>conferenceOrganizer</resp>
                  <name>James Royer</name>
                </respStmt>
                <imprint>
                  <date type="datePub">2006-08-10</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-cc">Computer Science [cs]/Computational Complexity [cs.CC]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In a previous paper, the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static analysis. Basically, a sup-interpretation provides an upper bound on the size of function outputs. In this former work, a criterion, which can be applied to terminating as well as non-terminating programs, was developed in order to bound polynomially the stack frame size. In this paper, we suggest a new criterion which captures more algorithms computing values polynomially bounded in the size of the inputs. Since this work is related to quasi-interpretations, we compare the two notions obtaining two main features. The first one is that, given a program, we have heuristics for finding a sup-interpretation when we consider polynomials of bounded degree. The other one consists in the characterizations of the set of function computable in polynomial time and in polynomial space.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-2347" status="OLD">
          <idno type="RNSR">199618306V</idno>
          <orgName>Linear logic, proof networks and categorial grammars</orgName>
          <orgName type="acronym">CALLIGRAMME</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/calligramme</ref>
          </desc>
          <listRelation>
            <relation active="#struct-2496" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-466633" type="direct"/>
            <relation active="#struct-300291" type="indirect"/>
            <relation active="#struct-300292" type="indirect"/>
            <relation active="#struct-300293" type="indirect"/>
            <relation name="UMR7503" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-2496" status="OLD">
          <orgName>INRIA Lorraine</orgName>
          <desc>
            <address>
              <addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-466633" status="OLD">
          <orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
          <orgName type="acronym">LORIA</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2011-12-31</date>
          <desc>
            <address>
              <addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-300291" type="direct"/>
            <relation active="#struct-300292" type="direct"/>
            <relation active="#struct-300293" type="direct"/>
            <relation name="UMR7503" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300291" status="OLD">
          <orgName>Université Henri Poincaré - Nancy 1</orgName>
          <orgName type="acronym">UHP</orgName>
          <date type="end">2011-12-31</date>
          <desc>
            <address>
              <addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300292" status="OLD">
          <orgName>Université Nancy 2</orgName>
          <date type="end">2011-12-31</date>
          <desc>
            <address>
              <addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300293" status="OLD">
          <orgName>Institut National Polytechnique de Lorraine</orgName>
          <orgName type="acronym">INPL</orgName>
          <date type="end">2011-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>