Case Analysis of Higher-Order Data

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.

[1]  Furio Honsell,et al.  A framework for defining logics , 1993, JACM.

[2]  Frank Pfenning,et al.  Tabled higher-order logic programming , 2003 .

[3]  Frank Pfenning,et al.  A Coverage Checking Algorithm for LF , 2003, TPHOLs.

[4]  F. Pfenning,et al.  Automating the meta theory of deductive systems , 2000 .

[5]  Carsten Schürmann,et al.  Practical Programming with Higher-Order Encodings and Dependent Types , 2008, ESOP.

[6]  Brigitte Pientka.  A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions , 2008, POPL '08.

[7]  Gopalan Nadathur,et al.  Combining Generic Judgments with Recursive Definitions , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[8]  Richard Statman,et al.  Higher-Order Rewriting with Dependent Types , 1999 .

[9]  Frank Pfenning,et al.  System Description: Twelf - A Meta-Logical Framework for Deductive Systems , 1999, CADE.

[10]  D. Walker,et al.  A concurrent logical framework I: Judgments and properties , 2003 .

[11]  Gopalan Nadathur,et al.  The Bedwyr System for Model Checking over Syntactic Expressions , 2007, CADE.

[12]  Dale Miller,et al.  A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification , 1991, J. Log. Comput..

[13]  Andrew McCreight,et al.  A Meta Linear Logical Framework , 2008, Electron. Notes Theor. Comput. Sci..

[14]  Conor McBride,et al.  Dependently typed functional programs and their proofs , 2000 .

[15]  Carsten Schürmann,et al.  The ∇-Calculus. Functional Programming with Higher-Order Encodings , 2004 .

[16]  Thierry Coquand,et al.  Pattern Matching with Dependent Types , 1992 .

[17]  Frank Pfenning,et al.  Contextual modal type theory , 2008, TOCL.

[18]  U. Norell,et al.  Towards a practical programming language based on dependent type theory , 2007 .