<?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 tel-01253426</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-11T02:00:26+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Lambda-calculus and formal language theory</title>
            <author role="aut">
              <persName>
                <forename type="first">Sylvain</forename>
                <surname>Salvati</surname>
              </persName>
              <email type="md5">328734269eecd6b0ebd060898fa96689</email>
              <email type="domain">univ-lille.fr</email>
              <idno type="idhal" notation="string">sylvain-salvati</idno>
              <idno type="idhal" notation="numeric">2196</idno>
              <idno type="halauthorid" notation="string">12159-2196</idno>
              <idno type="IDREF">https://www.idref.fr/090492420</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-6230-0098</idno>
              <orgName ref="#struct-300009"/>
              <affiliation ref="#struct-3102"/>
              <affiliation ref="#struct-410271"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Sylvain</forename>
                <surname>Salvati</surname>
              </persName>
              <email type="md5">328734269eecd6b0ebd060898fa96689</email>
              <email type="domain">univ-lille.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-01-10 14:23:23</date>
              <date type="whenModified">2025-05-26 14:36:02</date>
              <date type="whenReleased">2016-01-11 14:59:44</date>
              <date type="whenProduced">2015-12-10</date>
              <date type="whenEndEmbargoed">2016-01-10</date>
              <ref type="file" target="https://hal.science/tel-01253426v1/document">
                <date notBefore="2016-01-10"/>
              </ref>
              <ref type="file" n="1" target="https://hal.science/tel-01253426v1/file/hdr.pdf" id="file-1253426-1333528">
                <date notBefore="2016-01-10"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="130420">
                <persName>
                  <forename>Sylvain</forename>
                  <surname>Salvati</surname>
                </persName>
                <email type="md5">328734269eecd6b0ebd060898fa96689</email>
                <email type="domain">univ-lille.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">tel-01253426</idno>
            <idno type="halUri">https://hal.science/tel-01253426</idno>
            <idno type="halBibtex">salvati:tel-01253426</idno>
            <idno type="halRefHtml">Computer Science [cs]. Université de Bordeaux, 2015</idno>
            <idno type="halRef">Computer Science [cs]. Université de Bordeaux, 2015</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1253426-1333528"/></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="ENSEIRB">Ecole Nationale Supérieure d'Electronique, Informatique et Radiocommunications de Bordeaux</idno>
            <idno type="stamp" n="INRIA-BORDEAUX">INRIA Bordeaux - Sud-Ouest</idno>
            <idno type="stamp" n="UNIV-BORDEAUX">Université de Bordeaux</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="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="INRIA-300009">Inria 300009</idno>
            <idno type="stamp" n="UNIVERSITE-BORDEAUX">Université de Bordeaux</idno>
          </seriesStmt>
          <notesStmt/>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Lambda-calculus and formal language theory</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Sylvain</forename>
                    <surname>Salvati</surname>
                  </persName>
                  <email type="md5">328734269eecd6b0ebd060898fa96689</email>
                  <email type="domain">univ-lille.fr</email>
                  <idno type="idhal" notation="string">sylvain-salvati</idno>
                  <idno type="idhal" notation="numeric">2196</idno>
                  <idno type="halauthorid" notation="string">12159-2196</idno>
                  <idno type="IDREF">https://www.idref.fr/090492420</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-6230-0098</idno>
                  <orgName ref="#struct-300009"/>
                  <affiliation ref="#struct-3102"/>
                  <affiliation ref="#struct-410271"/>
                </author>
              </analytic>
              <monogr>
                <imprint>
                  <date type="dateDefended">2015-12-10</date>
                </imprint>
                <authority type="institution">Université de Bordeaux</authority>
                <authority type="supervisor">Courcelle Bruno</authority>
                <authority type="jury">Ehrhard Thomas</authority>
                <authority type="jury">Giorgio Satta</authority>
                <authority type="jury">Sophie Tison</authority>
                <authority type="jury">Philippe de Groote</authority>
                <authority type="jury">Jérôme Leroux</authority>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">denotational semantics</term>
                <term xml:lang="en">model checking</term>
                <term xml:lang="en">mathematics of language</term>
                <term xml:lang="en">formal language theory</term>
                <term xml:lang="en">Lambda-calculus</term>
                <term xml:lang="fr"> vérification</term>
                <term xml:lang="fr"> sémantique dénotationelle</term>
                <term xml:lang="fr"> mathématiques du langage</term>
                <term xml:lang="fr"> théorie des langages formels</term>
                <term xml:lang="fr">lambda-calcul</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="HDR">Habilitation à diriger des recherches</classCode>
              <classCode scheme="halOldTypology" n="HDR">Habilitation à diriger des recherches</classCode>
              <classCode scheme="halTreeTypology" n="HDR">Habilitation à diriger des recherches</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p> Formal and symbolic approaches have offered computer science many  application fields. The rich and fruitful connection between logic,  automata and algebra is one such approach. It has been used to model  natural languages as well as in program verification. In the  mathematics of language it is able to model phenomena ranging from  syntax to phonology while in verification it gives model checking  algorithms to a wide family of programs.  This thesis extends this approach to simply typed lambda-calculus by  providing a natural extension of recognizability to programs that  are representable by simply typed terms. This notion is then applied  to both the mathematics of language and program verification.  In  the case of the mathematics of language, it is used to generalize  parsing algorithms and to propose high-level methods to describe  languages. Concerning program verification, it is used to describe  methods for verifying the behavioral properties of higher-order  programs. In both cases, the link that is drawn between finite state  methods and denotational semantics provide the means to mix powerful  tools coming from the two worlds.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-3102" status="VALID">
          <idno type="IdRef">155054465</idno>
          <idno type="ISNI">0000000122898198</idno>
          <idno type="RNSR">199511665F</idno>
          <idno type="ROR">https://ror.org/03adqg323</idno>
          <idno type="Wikidata">Q3214395</idno>
          <orgName>Laboratoire Bordelais de Recherche en Informatique</orgName>
          <orgName type="acronym">LaBRI</orgName>
          <date type="start">1988-01-01</date>
          <desc>
            <address>
              <addrLine>Domaine Universitaire 351, cours de la Libération 33405 Talence Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.labri.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-259761" type="direct"/>
            <relation active="#struct-300366" type="direct"/>
            <relation name="UMR5800 / URA1304" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-410271" status="OLD">
          <idno type="RNSR">201521169Z</idno>
          <orgName>Models for a Structured Programming of Space and Time</orgName>
          <orgName type="acronym">PoSET</orgName>
          <date type="start">2015-01-01</date>
          <date type="end">2016-12-31</date>
          <desc>
            <address>
              <addrLine>200 Rue Vieille Tour,33405 Talence</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/poset</ref>
          </desc>
          <listRelation>
            <relation active="#struct-3102" type="direct"/>
            <relation active="#struct-259761" type="indirect"/>
            <relation active="#struct-300366" type="indirect"/>
            <relation name="UMR5800 / URA1304" active="#struct-441569" type="indirect"/>
            <relation active="#struct-85755" type="direct"/>
            <relation active="#struct-409745" type="indirect"/>
            <relation active="#struct-104751" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-259761" status="VALID">
          <idno type="IdRef">175206562</idno>
          <idno type="ROR">https://ror.org/057qpr032</idno>
          <orgName>Université de Bordeaux</orgName>
          <orgName type="acronym">UB</orgName>
          <desc>
            <address>
              <addrLine>35, place Pey Berland - 33076 Bordeaux</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-bordeaux.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300366" status="VALID">
          <orgName>École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)</orgName>
          <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>
        <org type="laboratory" xml:id="struct-85755" status="VALID">
          <orgName>Studio de Création et de Recherche en Informatique et Musique Électroacoustique</orgName>
          <orgName type="acronym">SCRIME</orgName>
          <desc>
            <address>
              <addrLine>Université Bordeaux 1 351 cours de la Libération 33405 Talence Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://scrime.labri.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-259761" type="direct"/>
            <relation active="#struct-409745" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-409745" status="VALID">
          <orgName>Institut Polytechnique de Bordeaux</orgName>
          <orgName type="acronym">Bordeaux INP</orgName>
          <desc>
            <address>
              <addrLine>Avenue des facultés33405 Talence</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.bordeaux-inp.fr/fr</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-104751" status="VALID">
          <idno type="RNSR">200818243Z</idno>
          <idno type="ROR">https://ror.org/03tjcj052</idno>
          <orgName>Centre Inria de l'Université de Bordeaux</orgName>
          <desc>
            <address>
              <addrLine>200, avenue de la Vieille Tour, 33405 Talence</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/bordeaux/</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>
      </listOrg>
    </back>
  </text>
</TEI>