<?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 hal-03698879</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-17T09:36:56+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A direct computational interpretation of second-order arithmetic via update recursion</title>
            <author role="aut">
              <persName>
                <forename type="first">Valentin</forename>
                <surname>Blot</surname>
              </persName>
              <email type="md5">bee69c19a3162ea57ceb370dd66fd04a</email>
              <email type="domain">valentinblot.org</email>
              <idno type="idhal" notation="string">vblot</idno>
              <idno type="idhal" notation="numeric">1545</idno>
              <idno type="halauthorid" notation="string">17332-1545</idno>
              <affiliation ref="#struct-1065839"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Valentin</forename>
                <surname>Blot</surname>
              </persName>
              <email type="md5">bee69c19a3162ea57ceb370dd66fd04a</email>
              <email type="domain">valentinblot.org</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2022-06-19 16:41:58</date>
              <date type="whenModified">2025-10-27 11:04:02</date>
              <date type="whenReleased">2022-06-20 09:12:24</date>
              <date type="whenProduced">2022-08-02</date>
              <date type="whenEndEmbargoed">2022-06-19</date>
              <ref type="file" target="https://inria.hal.science/hal-03698879v1/document">
                <date notBefore="2022-06-19"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-03698879v1/file/paper.pdf" id="file-3698879-3230929">
                <date notBefore="2022-06-19"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="180631">
                <persName>
                  <forename>Valentin</forename>
                  <surname>Blot</surname>
                </persName>
                <email type="md5">bee69c19a3162ea57ceb370dd66fd04a</email>
                <email type="domain">valentinblot.org</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03698879</idno>
            <idno type="halUri">https://inria.hal.science/hal-03698879</idno>
            <idno type="halBibtex">blot:hal-03698879</idno>
            <idno type="halRefHtml">&lt;i&gt;LICS 2022 - 37th Annual ACM/IEEE Symposium on Logic in Computer Science&lt;/i&gt;, Aug 2022, Haïfa, Israel. &lt;a target="_blank" href="https://dx.doi.org/10.1145/3531130.3532458"&gt;&amp;#x27E8;10.1145/3531130.3532458&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">LICS 2022 - 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Aug 2022, Haïfa, Israel. &amp;#x27E8;10.1145/3531130.3532458&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-3698879-3230929"/></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="ENS-CACHAN">Ecole Normale Supérieure de Cachan</idno>
            <idno type="stamp" n="INRIA-SACLAY" corresp="INRIA">INRIA Saclay - Ile de France</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="UNIVERSITE-PARIS-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="ENS-PARIS-SACLAY">Ecole Normale Supérieure paris-Saclay</idno>
            <idno type="stamp" n="ENS-PSACLAY">Ecole Normale Supérieure Paris-Saclay</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="LMF-LC">Langages et Compilation</idno>
            <idno type="stamp" n="LMF">Laboratoire Méthodes Formelles</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</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="en">A direct computational interpretation of second-order arithmetic via update recursion</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Valentin</forename>
                    <surname>Blot</surname>
                  </persName>
                  <email type="md5">bee69c19a3162ea57ceb370dd66fd04a</email>
                  <email type="domain">valentinblot.org</email>
                  <idno type="idhal" notation="string">vblot</idno>
                  <idno type="idhal" notation="numeric">1545</idno>
                  <idno type="halauthorid" notation="string">17332-1545</idno>
                  <affiliation ref="#struct-1065839"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>LICS 2022 - 37th Annual ACM/IEEE Symposium on Logic in Computer Science</title>
                  <date type="start">2022-08-02</date>
                  <date type="end">2022-08-05</date>
                  <settlement>Haïfa</settlement>
                  <country key="IL">Israel</country>
                </meeting>
                <imprint/>
              </monogr>
              <idno type="doi">10.1145/3531130.3532458</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</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>Second-order arithmetic has two kinds of computational interpretations: via Spector's bar recursion of via Girard's polymorphic lambda-calculus. Bar recursion interprets the negative translation of the axiom of choice which, combined with an interpretation of the negative translation of the excluded middle, gives a computational interpretation of the negative translation of the axiom scheme of comprehension. It is then possible to instantiate universally quantified sets with arbitrary formulas (second-order elimination). On the other hand, polymorphic lambda-calculus interprets directly second-order elimination by means of polymorphic types. The present work aims at bridging the gap between these two interpretations by interpreting directly second-order elimination through update recursion, which is a variant of bar recursion.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-1065839" status="VALID">
          <idno type="RNSR">201121007R</idno>
          <idno type="ROR">https://ror.org/0305gxg06</idno>
          <orgName>Deduction modulo, interopérabilité et démonstration automatique</orgName>
          <orgName type="acronym">DEDUCTEAM</orgName>
          <date type="start">2021-01-01</date>
          <date type="end">2028-12-31</date>
          <desc>
            <address>
              <addrLine>ENS Paris-Saclay - 4 Av. des Sciences, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/deducteam</ref>
          </desc>
          <listRelation>
            <relation active="#struct-1065710" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-419361" type="indirect"/>
            <relation name="UMR9021" active="#struct-441569" type="indirect"/>
            <relation active="#struct-523723" type="indirect"/>
            <relation active="#struct-1225627" type="direct"/>
            <relation active="#struct-118511" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-1065710" status="VALID">
          <idno type="IdRef">25474589X</idno>
          <idno type="RNSR">202123712M</idno>
          <idno type="ROR">https://ror.org/00gdtta79</idno>
          <idno type="Wikidata">Q109042513</idno>
          <orgName>Laboratoire Méthodes Formelles</orgName>
          <orgName type="acronym">LMF</orgName>
          <date type="start">2021-01-01</date>
          <desc>
            <address>
              <addrLine>4, avenue des Sciences, 91190, Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation active="#struct-419361" type="direct"/>
            <relation name="UMR9021" active="#struct-441569" type="direct"/>
            <relation active="#struct-523723" 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="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-419361" status="VALID">
          <idno type="IdRef">241345251</idno>
          <idno type="ROR">https://ror.org/03xjwb503</idno>
          <orgName>Université Paris-Saclay</orgName>
          <desc>
            <address>
              <addrLine>Bâtiment Bréguet, 3 Rue Joliot Curie 2e ét, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.universite-paris-saclay.fr/fr</ref>
          </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>
        <org type="institution" xml:id="struct-523723" status="VALID">
          <idno type="ROR">https://ror.org/00hx6zz33</idno>
          <orgName>Ecole Normale Supérieure  Paris-Saclay</orgName>
          <orgName type="acronym">ENS Paris Saclay</orgName>
          <desc>
            <address>
              <addrLine>4 avenue des Sciences, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://ens-paris-saclay.fr/</ref>
          </desc>
        </org>
        <org type="department" xml:id="struct-1225627" status="VALID">
          <idno type="ROR">https://ror.org/040753f36</idno>
          <orgName>Centre Inria de l'Université Paris-Saclay</orgName>
          <date type="start">2022-11-01</date>
          <desc>
            <address>
              <addrLine>9 Rue Joliot Curie, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-118511" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-118511" status="VALID">
          <idno type="RNSR">200818248E</idno>
          <idno type="ROR">https://ror.org/0315e5x55</idno>
          <orgName>Centre Inria de Saclay</orgName>
          <desc>
            <address>
              <addrLine>1 rue Honoré d'Estienne d'OrvesBâtiment Alan TuringCampus de l'École Polytechnique91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/saclay</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>