Moreover, it is modular over the kind of approximated sets used. We give two example implementations of such approximated sets: one is based on truncated terms, ...

Definition of functions by pattern matching has proved to be a key feature of functional programming languages. These definitions allow a clear, ...

Bibliographic details on Pattern matching coverage checking with dependent types using set approximations.

Pattern matching coverage checking with dependent types using set approximations. N Oury. Proceedings of the 2007 workshop on Programming languages meets ...

We present an algorithm elaborating definitions by dependent copattern matching to a core language with inductive datatypes, coinductive record types, an ...

We introduce a coverage checking algorithm called Lower Your Guards, which boils down the complexities of pattern matching into guard trees. While the source ...

Jan 21, 2020 · We present an algorithm elaborating definitions by dependent copattern matching to a core language with inductive data types, coinductive record types, an ...

Pattern matching coverage checking with dependent types using set approximations. Nicolas Oury. Abstract: Definition of functions by pattern matching has proved ...

Pattern matching coverage checking with dependent types using set approximations. In Aaron Stump and Hongwei Xi, editors, PLPV, pages 47–56. ACM, 2007. 10 ...

We present an algorithm elaborating definitions by dependent copattern matching to a core language with inductive datatypes, coinductive record types, an ...