A Coverage Checking Algorithm for LF

A Coverage Checking Algorithm for LF (2003)

by Carsten Schürmann , Frank Pfenning

Citations:

36 - 11 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A Coverage Checking Algorithm for LF	user correction - Legacy Corrections
AUTHOR NAME	Carsten Schürmann	user correction - Legacy Corrections
AUTHOR NAME	Frank Pfenning	user correction - Legacy Corrections
AUTHOR AFFIL	; 1; Yale University; 2; Carnegie Mellon University	user correction - Legacy Corrections
AUTHOR ADDR	; 2 #; New Haven, CT, USA,; Pittsburgh, PA, USA,	user correction - Legacy Corrections
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 presence of dependent types. In this paper we present a terminating algorithm for verifying coverage of higher-order, dependently typed patterns.	user correction - Legacy Corrections
YEAR	2003	user correction - Legacy Corrections
CITATIONS	27 found	ParsCit 1.0