Case analysis of higher-order data

Case analysis of higher-order data

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Joshua Dunfield , Brigitte Pientka

Citations:

12 - 10 self

BibTeX

@MISC{Dunfield_caseanalysis,
    author = {Joshua Dunfield and Brigitte Pientka},
    title = {Case analysis of higher-order data},
    year = {}
}

Bookmark

OpenURL

Abstract

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 that required objects to be closed, we consider open data objects, i.e. objects that may depend on some context. Our work may therefore provide insights 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

Citations

634	A framework for defining logics - Harper, Honsell, et al. - 1999
281	System description: Twelf - a meta-logical framework for deductive systems - Pfenning, Schürmann - 1999
271	A logic programming language with lambda-abstraction, function variables, and simple unification - Miller - 1991
112	Towards a Practical Programming Language Based on Dependent Type Theory - Norell - 2007
78	Automating the meta theory of deductive systems - Schürmann - 2000
75	Pattern matching with dependent types - Coquand - 1992
61	Dependently Typed Functional Programs and Their Proofs - McBride - 2000
59	A concurrent logical framework i: Judgments and properties - Watkins, Cervesato, et al. - 2002
40	A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions - Pientka - 2008
38	Contextual modal type theory - Nanevski, Pfenning, et al.
36	A coverage checking algorithm for LF - Schürmann, Pfenning - 2003
27	Higher-Order Rewriting with Dependent Types - Virga - 1999
25	Tabled higher-order logic programming - PIENTKA
24	Practical programming with higher-order encodings and dependent types - Poswolsky, Schürmann - 2008
23	The ▽-calculus. Functional programming with higher-order encodings - Schürmann, Poswolsky, et al. - 2005
14	The Bedwyr system for model checking over syntactic expressions - Baelde, Gacek, et al. - 2007
12	Gopalan Nadathur, and Alwen Tiu. The Bedwyr system for model checking over syntactic expressions - Baelde, Gacek, et al. - 2007
11	Combining generic judgments with recursive definitions - Gacek, Miller, et al. - 2008
6	Gopalan Nadathur. Combining generic judgments with recursive definitions - Gacek, Miller - 2008
5	A meta linear logical framework - McCreight, Schürmann - 2003