Nous rejoindre

Revues

Actes de conférences

ElPub

[Electronic Publishing]

ElPub

Electronic Publishing

La conférence ElPub, tenue annuellement entre 1997 et 2020, présente les résultats de la recherche sur divers aspects de l’édition numérique, impliquant une communauté internationale diversifiée dans toutes les disciplines des sciences et des humanités.

La dernière conférence ElPub date de 2020 ; les textes des conférences 2018, 2019 et 2020 restent accessibles sur le site.

  • Type de support : électronique
  • État de la collection : 2018-2020
  • Périodicité : annuelle
  • Date de mise en ligne sur Episciences : 2018
  • Langue de publication : anglais
Voir le site

Derniers articles

Actes de conférences
Informatique et mathématiques appliquées

ENTICS

[Electronic Notes in Theoretical Informatics and Computer Science]

ENTICS

Electronic Notes in Theoretical Informatics and Computer Science

ENTICS, Electronic Notes in Theoretical Informatics and Computer Science, créée en 2022, publie, au fil de l’eau en anglais, des actes de conférences et de workshops en informatique théorique.

  • Directeur de la publication : Bruno Sportisse
  • Rédacteur en chef : Michael Mislove
  • Type de support : électronique
  • Périodicité : au fil de l’eau
  • Année de création : 2022
  • Date de mise en ligne sur Episciences : 2023
  • eISSN : 2969-2431
  • Disciplines : informatique théorique
  • Langue de publication : anglais
  • Procédure d’évaluation : simple aveugle
  • Licence CC BY 4.0
  • Éditeur : Inria
    • Adresse postale : Domaine de Voluceau Rocquencourt – B.P. 105 78153 Le Chesnay Cedex
    • Pays : France
  • Contact : entics AT episciences.org
Voir le site

Derniers articles

Implicit automata in {\lambda}-calculi III: affine planar string-to-string functions

We prove a characterization of first-order string-to-string transduction via $\lambda$-terms typed in non-commutative affine logic that compute with Church encoding, extending the analogous known characterization of star-free languages. We show that every first-order transduction can be computed by a $\lambda$-term using a known Krohn-Rhodes-style decomposition lemma. The converse direction is given by compiling $\lambda$-terms into two-way reversible planar transducers. The soundness of this translation involves showing that the transition functions of those transducers live in a monoidal closed category of diagrams in which we can interpret purely affine $\lambda$-terms. One challenge is that the unit of the tensor of the category in question is not a terminal object. As a result, our interpretation does not identify $\beta$-equivalent terms, but it does turn $\beta$-reductions into inequalities in a poset-enrichment of the category of diagrams.
Pradic, Cécilia
11 décembre 2024
Lire l'article

Cost-sensitive computational adequacy of higher-order recursion in synthetic domain theory

We study a cost-aware programming language for higher-order recursion dubbed $\textbf{PCF}_\mathsf{cost}$ in the setting of synthetic domain theory (SDT). Our main contribution relates the denotational cost semantics of $\textbf{PCF}_\mathsf{cost}$ to its computational cost semantics, a new kind of dynamic semantics for program execution that serves as a mathematically natural alternative to operational semantics in SDT. In particular we prove an internal, cost-sensitive version of Plotkin's computational adequacy theorem, giving a precise correspondence between the denotational and computational semantics for complete programs at base type. The constructions and proofs of this paper take place in the internal dependent type theory of an SDT topos extended by a phase distinction in the sense of Sterling and Harper. By controlling the interpretation of cost structure via the phase distinction in the denotational semantics, we show that $\textbf{PCF}_\mathsf{cost}$ programs also evince a noninterference property of cost and behavior. We verify the axioms of the type theory by means of a model construction based on relative sheaf models of SDT.
Niu, Yue
11 décembre 2024
Lire l'article