Functional Pearl: the Proof Search Monad
Keyword(s):
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 “for free”, which makes a verified, independent validation approach easier too.
Keyword(s):
2020 ◽
Vol 19
(10)
◽
pp. 1602-1618
◽
Keyword(s):
2001 ◽
Vol 1
(3)
◽
pp. 28-31
◽
Keyword(s):
2019 ◽
Vol 71
(1)
◽
pp. 54-71
◽
Keyword(s):
2018 ◽
Vol 2
(2)
◽
pp. 186
Keyword(s):
2016 ◽
Keyword(s):
2016 ◽
2016 ◽