A Coverage Checking Algorithm for LF

Abstract

Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a function defined by pattern matching covers all possible cases. This problem has a straightforward solution for the first-order, simply-typed case, but is in general undecidable in the… (More)
DOI: 10.1007/10930755_8

Topics

2 Figures and Tables

Statistics

051015'04'06'08'10'12'14'16'18
Citations per Year

88 Citations

Semantic Scholar estimates that this publication has 88 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics