Focusing on pattern matching
NR Krishnaswami - ACM SIGPLAN Notices, 2009 - dl.acm.org
ACM SIGPLAN Notices, 2009•dl.acm.org
In this paper, we show how pattern matching can be seen to arise from a proof term
assignment for the focused sequent calculus. This use of the Curry-Howard correspondence
allows us to give a novel coverage checking algorithm, and makes it possible to give a
rigorous correctness proof for the classical pattern compilation strategy of building decision
trees via matrices of patterns.
assignment for the focused sequent calculus. This use of the Curry-Howard correspondence
allows us to give a novel coverage checking algorithm, and makes it possible to give a
rigorous correctness proof for the classical pattern compilation strategy of building decision
trees via matrices of patterns.
In this paper, we show how pattern matching can be seen to arise from a proof term assignment for the focused sequent calculus. This use of the Curry-Howard correspondence allows us to give a novel coverage checking algorithm, and makes it possible to give a rigorous correctness proof for the classical pattern compilation strategy of building decision trees via matrices of patterns.
ACM Digital Library