Proc. of a conference on Functional programming languages and computer architecture
Information and Computation
Information and Computation
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
The Definition of Standard ML
A Term Pattern-Match Compiler Inspired by Finite Automata Theory
CC '92 Proceedings of the 4th International Conference on Compiler Construction
Compiling a functional language
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Pattern matching as cut elimination
Theoretical Computer Science
Simple unification-based type inference for GADTs
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
A constraint-based approach to guarded algebraic data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
Focusing and higher-order abstract syntax
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Focusing and polarization in intuitionistic logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
QML: explicit first-class polymorphism for ML
Proceedings of the 2009 ACM SIGPLAN workshop on ML
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Copatterns: programming infinite structures by observations
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
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.