Implicit automata in typed λ-calculi I: aperiodicity in a non-commutative logic - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Implicit automata in typed λ-calculi I: aperiodicity in a non-commutative logic

Résumé

We give a characterization of star-free languages in a λ-calculus with support for non-commutative affine types (in the sense of linear logic), via the algebraic characterization of the former using aperiodic monoids. When the type system is made commutative, we show that we get regular languages instead. A key ingredient in our approach – that it shares with higher-order model checking – is the use of Church encodings for inputs and outputs. Our result is, to our knowledge, the first use of non-commutativity in implicit computational complexity.
Fichier principal
Vignette du fichier
aperiodic.pdf (634.25 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02476219 , version 1 (12-02-2020)
hal-02476219 , version 2 (22-04-2020)
hal-02476219 , version 3 (13-02-2023)

Licence

Paternité

Identifiants

  • HAL Id : hal-02476219 , version 3

Citer

Lê Thành Dũng Nguyễn, Cécilia Pradic. Implicit automata in typed λ-calculi I: aperiodicity in a non-commutative logic. 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Jul 2020, Saarbrücken (virtual conference), Germany. ⟨hal-02476219v3⟩
350 Consultations
419 Téléchargements

Partager

Gmail Facebook X LinkedIn More