{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:38:00Z","timestamp":1753889880217,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T00:00:00Z","timestamp":1549324800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T00:00:00Z","timestamp":1549324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T00:00:00Z","timestamp":1549324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>We investigate the interplay between a modality for controlling the behaviour of recursive functional programs on infinite structures which are completely silent in the syntax. The latter means that programs do not contain &amp;quot;marks&amp;quot; showing the application of the introduction and elimination rules for the modality. This shifts the burden of controlling recursion from the programmer to the compiler. To do this, we introduce a typed lambda calculus a la Curry with a silent modality and guarded recursive types. The typing discipline guarantees normalisation and can be transformed into an algorithm which infers the type of a program.<\/jats:p><jats:p>Comment: 32 pages 1 figure in pdf format<\/jats:p>","DOI":"10.23638\/lmcs-15(1:8)2019","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:35:40Z","timestamp":1743701740000},"source":"Crossref","is-referenced-by-count":0,"title":["A Light Modality for Recursion"],"prefix":"10.23638","volume":"Volume 15, Issue 1","author":[{"given":"Paula","family":"Severi","sequence":"first","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2019,2,5]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1801.00285v5","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1801.00285v5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:35:41Z","timestamp":1743701741000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/4174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,5]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-15(1:8)2019","relation":{"has-preprint":[{"id-type":"arxiv","id":"1801.00285v4","asserted-by":"subject"},{"id-type":"arxiv","id":"1801.00285v3","asserted-by":"subject"},{"id-type":"arxiv","id":"1801.00285v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1801.00285v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1801.00285","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1801.00285","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2019,2,5]]},"article-number":"4174"}}