{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:32:13Z","timestamp":1767929533207,"version":"3.49.0"},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Hilbert's epsilon operator is a binder that picks an arbitrary element from<\/jats:p><jats:p>a nonempty set.  The operator is typically used in logics and proof engines.<\/jats:p><jats:p>This paper contributes a discussion of considerations in supporting this operator<\/jats:p><jats:p>in a programming language.  More specifically, the paper presents the design choices<\/jats:p><jats:p>made around supporting this operator in the verification-aware language Dafny.<\/jats:p>","DOI":"10.29007\/rkxm","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T18:04:15Z","timestamp":1516730655000},"page":"106-92","source":"Crossref","is-referenced-by-count":2,"title":["Compiling Hilbert's epsilon operator"],"prefix":"10.29007","volume":"35","author":[{"given":"Rustan","family":"Leino","sequence":"first","affiliation":[]}],"member":"11545","event":{"name":"LPAR-20. 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T18:05:16Z","timestamp":1516730716000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/dM"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/rkxm","relation":{},"ISSN":["2398-7340"],"issn-type":[{"value":"2398-7340","type":"print"}],"subject":[]}}