{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:47:12Z","timestamp":1725479232955},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>It is well known that general recursion cannot be expressed within Martin-L\u00f6f's type theory and that various approaches have been proposed to overcome this problem still maintaining the termination of the computation of the typable terms. In this work we propose a new approach to this problem based on the use of inductively generated formal topologies.<\/jats:p>","DOI":"10.29007\/hl75","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T21:38:52Z","timestamp":1516743532000},"page":"72-59","source":"Crossref","is-referenced-by-count":1,"title":["General Recursion and Formal Topology"],"prefix":"10.29007","volume":"5","author":[{"given":"Claudio","family":"Sacerdoti Coen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvio","family":"Valentini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"PAR-10. Partiality and Recursion in Interactive Theorem Provers"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T21:38:55Z","timestamp":1516743535000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/q9b2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/hl75","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}