{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:25:35Z","timestamp":1725528335694},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We present the proof search monad, a set of combinators that allows one to write a proof search engine in a style that resembles the formal rules closely. The user calls functions such as premise, prove or choice; the library then takes care of generating a derivation tree. Proof search engines written in this style enjoy: first, a one-to-one correspondence between the implementation and the derivation rules, which makes manual inspection easier; second, proof witnesses \u201cfor free\u201d, which makes a verified, independent validation approach easier too.<\/jats:p>","DOI":"10.29007\/cfdq","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:04:19Z","timestamp":1516748659000},"page":"91-75","source":"Crossref","is-referenced-by-count":0,"title":["Functional Pearl: the Proof Search Monad"],"prefix":"10.29007","volume":"40","author":[{"given":"Jonathan","family":"Protzenko","sequence":"first","affiliation":[]}],"member":"11545","event":{"name":"IWIL-2015. 11th International Workshop on the Implementation of Logics"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:04:22Z","timestamp":1516748662000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/HzFg"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/cfdq","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}