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...
Uloženo v:
| Vydáno v: | Electronic Notes in Theoretical Informatics and Computer Science Ročník 4 - Proceedings of... |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
11.12.2024
|
| ISSN: | 2969-2431, 2969-2431 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | 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.
Comment: 19+1 pages, 7 figures; camera-ready version for MFPS |
|---|---|
| AbstractList | 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.
Comment: 19+1 pages, 7 figures; camera-ready version for MFPS |
| Author | Pradic, Cécilia Price, Ian |
| Author_xml | – sequence: 1 givenname: Cécilia surname: Pradic fullname: Pradic, Cécilia – sequence: 2 givenname: Ian surname: Price fullname: Price, Ian |
| BookMark | eNpN0L1LxDAcxvEgJ3ieN7rnH8iZtHmrmxy-FA5cOgrllzSRQJqWJh1E_N-FOwen5zs9w-cWbdKUHEL3jB64rBr94FIJNh8Y15RfoW3VyIZUvGabf32D9jkHQwWjWohGbVHXjnMMNhQMa5lGKIBDwt8fEUYzwA-xEO0aA27b9hGD9yE5PEdIsOBclpA-SZnIpbBfky1hSvkOXXuI2e3_doe6l-fu-EZO76_t8elErFKcmBq4MJIr5YUUfuDMuqYWoAQTCqR1XjrGoPJGu8oAlVJYppXlA2gF2tc7RC63dplyXpzv5yWMsHz1jPZnlP6C0p9R6l_aKVld |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.46298/entics.14804 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| EISSN | 2969-2431 |
| ExternalDocumentID | 10_46298_entics_14804 |
| GroupedDBID | AAFWJ AAYXX ADQAK CITATION M~E |
| ID | FETCH-LOGICAL-c774-b3a45b6477f565fd41ce935a75157a6cef6e11a2fb8e2ba0665c187c4da87a8f3 |
| ISSN | 2969-2431 |
| IngestDate | Wed Oct 29 21:22:19 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c774-b3a45b6477f565fd41ce935a75157a6cef6e11a2fb8e2ba0665c187c4da87a8f3 |
| OpenAccessLink | https://entics.episciences.org/14804/pdf |
| ParticipantIDs | crossref_primary_10_46298_entics_14804 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-12-11 |
| PublicationDateYYYYMMDD | 2024-12-11 |
| PublicationDate_xml | – month: 12 year: 2024 text: 2024-12-11 day: 11 |
| PublicationDecade | 2020 |
| PublicationTitle | Electronic Notes in Theoretical Informatics and Computer Science |
| PublicationYear | 2024 |
| SSID | ssib051085597 |
| Score | 2.2766252 |
| Snippet | We prove a characterization of first-order string-to-string transduction via $\lambda$-terms typed in non-commutative affine logic that compute with Church... |
| SourceID | crossref |
| SourceType | Index Database |
| Title | Implicit automata in {\lambda}-calculi III: affine planar string-to-string functions |
| Volume | 4 - Proceedings of... |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2969-2431 dateEnd: 99991231 omitProxy: false ssIdentifier: ssib051085597 issn: 2969-2431 databaseCode: M~E dateStart: 20230101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pi9QwFA7j6sGLKCq6_iAHx8uQ0aZpk3jTccWCDh4G2YMwpGkChaEzjJ1lQRT8z3351RmXOawHL6WkbWj7fX15Td73HkIvTOOTmDdECUsJE3VORJMXpNSNUJktNfM1I79-4vO5OD-XX0aj30kLc7HiXScuL-Xmv0INbQC2k87-A9xDp9AA-wA6bAF22F4L-MrHiLf9RO36Nfijyk1pjPm7cTED9OtGjfl7Asjo3aqdVFXl5c7WOm9zs1Kd2jr9CAxopF-TsDdxg99-Yi_N4-8L6MzXvY_rCkr_KIuMQqchDXSqH5HMyWCUt6ppfZ31WVi11-2qVfujsSx9FWkcZyioz4MYLag3ZFSWbhUnWntzpC1aYjYhQR_hx20XyjKdTo_ZeVZSKTy67iHA2otQw_jvfNpXxrkh-hD-e3wHy3D50l9-A92kvJAuKvDzr7Nkkgonzih8iZ7hjkOmVt_Dq8MbOPBsDlyUxV10J_5b4LeBE_fQyHT30SLxASc-4LbDP74FLvxMTMDAhDc48AAHHuCrPMADDx6gxYezxewjiaU0iAb_ntS5YkXtNMcWHHjbsEwbmReKgzfLVamNLU2WKWprYWit3HKczgTXrFGCw1ecP0Qn3bozjxC2jcqpoi4pEGO1S68omaRCv5ZaWGbYY_QyvYXlJiRMWR594afXPfEJur1n1VN00m935hm6pS_69vv2uYfrD62mZMs |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Implicit+automata+in+%7B%5Clambda%7D-calculi+III%3A+affine+planar+string-to-string+functions&rft.jtitle=Electronic+Notes+in+Theoretical+Informatics+and+Computer+Science&rft.au=Pradic%2C+C%C3%A9cilia&rft.au=Price%2C+Ian&rft.date=2024-12-11&rft.issn=2969-2431&rft.eissn=2969-2431&rft.volume=4+-+Proceedings+of...&rft_id=info:doi/10.46298%2Fentics.14804&rft.externalDBID=n%2Fa&rft.externalDocID=10_46298_entics_14804 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2969-2431&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2969-2431&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2969-2431&client=summon |