{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:37:43Z","timestamp":1753889863565,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"crossref","award":["ANR-14-CE25-0007"],"award-info":[{"award-number":["ANR-14-CE25-0007"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>Church's synthesis problem asks whether there exists a finite-state stream transducer satisfying a given input-output specification. For specifications written in Monadic Second-Order Logic (MSO) over infinite words, Church's synthesis can theoretically be solved algorithmically using automata and games. We revisit Church's synthesis via the Curry-Howard correspondence by introducing SMSO, an intuitionistic variant of MSO over infinite words, which is shown to be sound and complete w.r.t. synthesis thanks to an automata-based realizability model.<\/jats:p>","DOI":"10.23638\/lmcs-15(4:13)2019","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:37:00Z","timestamp":1743701820000},"source":"Crossref","is-referenced-by-count":0,"title":["A Curry-Howard Approach to Church's Synthesis"],"prefix":"10.23638","volume":"Volume 15, Issue 4","author":[{"given":"C\u00e9cilia","family":"Pradic","sequence":"first","affiliation":[]},{"given":"Colin","family":"Riba","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2019,12,9]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1803.08958v4","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1803.08958v4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:37:01Z","timestamp":1743701821000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/4414"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,9]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-15(4:13)2019","relation":{"has-preprint":[{"id-type":"arxiv","id":"1803.08958v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1803.08958v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1803.08958","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1803.08958","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2019,12,9]]},"article-number":"4414"}}