{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T02:45:20Z","timestamp":1750387520796},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The \u03bb\u03a0-calculus modulo is a proof language that has been proposed as a proof standard<\/jats:p><jats:p>for (re-)checking and interoperability. Resolution and superposition are proof-search methods that are used in state-of-the-art first-order automated theorem provers. We provide a shallow embedding of resolution and superposition proofs in the \u03bb\u03a0-calculus modulo, thus offering a way to check these proofs in a trusted setting, and to combine them with other proofs. We implement this embedding as a backend of the prover iProver Modulo.<\/jats:p>","DOI":"10.29007\/ftc2","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T22:59:05Z","timestamp":1516748345000},"page":"43-27","source":"Crossref","is-referenced-by-count":3,"title":["A Shallow Embedding of Resolution and Superposition Proofs into the $\\lambda\\Pi$-Calculus Modulo"],"prefix":"10.29007","volume":"14","author":[{"given":"Guillaume","family":"Burel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"PxTP 2013. Third International Workshop on Proof Exchange for Theorem Proving"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T23:00:10Z","timestamp":1516748410000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/jZZS"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/ftc2","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}