{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T03:29:43Z","timestamp":1725420583743},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Venanzio Capretta, Varmo Vene and I have previously studied antifounded algebras as a a category-theoretic formulation of antifounded coinduction. These are the dual of wellfounded coalgebras, a category theorist's take on wellfounded induction, closely related to the Bove-Capretta method for justifying function definitions by general recursion in type theory.<\/jats:p><jats:p>In this talk, we discuss one possible type-theoretic approach to antifounded coinduction.<\/jats:p>","DOI":"10.29007\/gh62","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T21:38:52Z","timestamp":1516743532000},"page":"114-112","source":"Crossref","is-referenced-by-count":0,"title":["Antifounded Coinduction in Type Theory"],"prefix":"10.29007","volume":"5","author":[{"given":"Tarmo","family":"Uustalu","sequence":"first","affiliation":[]}],"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:54Z","timestamp":1516743534000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/Lv"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/gh62","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}