Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
424166 | Electronic Notes in Theoretical Computer Science | 2009 | 16 Pages |
Abstract
We discuss coverage checking for data that is dependently typed and is defined using higher-order abstract syntax. Unlike previous work on coverage checking for closed data, we consider open data which may depend on some context. Our work may therefore provide insight into coverage checking in Twelf, and serve as a basis for coverage checking in functional languages such as Delphin and Beluga. More generally, our work is a foundation for proofs by case analysis in systems that reason about higher-order abstract syntax.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics