 |
Free and accessible knowledge |
Conference papers
Implicit automata in typed λ-calculi I: aperiodicity in a non-commutative logic
Abstract : 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.
Cited literature [51 references]
https://hal.archives-ouvertes.fr/hal-02476219
Contributor : Lê Thành Dũng Nguyễn Connect in order to contact the contributor
Submitted on : Wednesday, April 22, 2020 - 3:17:06 AM
Last modification on : Wednesday, June 2, 2021 - 3:28:25 AM
Contributor : Lê Thành Dũng Nguyễn Connect in order to contact the contributor
Submitted on : Wednesday, April 22, 2020 - 3:17:06 AM
Last modification on : Wednesday, June 2, 2021 - 3:28:25 AM
File
aperiodic.pdf
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License