{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:38:29Z","timestamp":1753889909128,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T00:00:00Z","timestamp":1490227200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T00:00:00Z","timestamp":1490227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T00:00:00Z","timestamp":1490227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>We consider lambda-Y-calculus as a non-interpreted functional programming language: the result of the execution of a program is its normal form that can be seen as the tree of calls to built-in operations. Weak monadic second-order logic (wMSOL) is well suited to express properties of such trees. We give a type system for ensuring that the result of the execution of a lambda-Y-program satisfies a given wMSOL property. In order to prove soundness and completeness of the system we construct a denotational semantics of lambda-Y-calculus that is capable of computing properties expressed in wMSOL.<\/jats:p>","DOI":"10.23638\/lmcs-13(1:14)2017","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:31:44Z","timestamp":1743701504000},"source":"Crossref","is-referenced-by-count":0,"title":["Typing weak MSOL properties"],"prefix":"10.23638","volume":"Volume 13, Issue 1","author":[{"given":"Sylvain","family":"Salvati","sequence":"first","affiliation":[]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2017,3,23]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1609.02753v2","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1609.02753v2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:31:44Z","timestamp":1743701504000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/3215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,23]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-13(1:14)2017","relation":{"is-same-as":[{"id-type":"arxiv","id":"1609.02753","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1609.02753","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2017,3,23]]},"article-number":"3215"}}