Carsten Schürmann, Frank Pfenning  Home/Search
Context Related
| cmu.edu/~fp/papers/coverage03.ps yale.edu/homes/carsten/p...coverage.pdf cmu.edu/afs/cs/user/fp/...coverage03.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~fp/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Cited by: More
A Symmetric Modal Lambda Calculus for Distributed - Computing Tom Murphy (Correct)
Distributed Control Flow - With Classical Modal (Correct)
A Symmetric Modal Lambda Calculus for Distributed Computing - Tom Murphy Vii (2004) (Correct)
Similar documents (at the sentence level):
69.6%: A Coverage Checking Algorithm for LF - Schürmann, Pfenning (2003) (Correct)
Active bibliography (related documents): More All
0.6: Verifying Uniqueness in a Logical Framework - Anderson, Pfenning (2004) (Correct)
0.3: Delphin: Functional Programming with Deductive Systems - Schürmann, Fontana, Liao (Correct)
0.3: The Practice of Logical Frameworks - Frank Pfenning (1996) (Correct)
Similar documents based on text: More All
0.4: Automated Theorem Proving in a Simple Meta Logic for LF - Schürmann, Pfenning (1998) (Correct)
0.4: Twelf - Schürmann (2002) (Correct)
0.4: System Description: Twelf - A Meta-Logical Framework for.. - Pfenning, Schürmann (1999) (Correct)
Related documents from co-citation: More All
26: A spatial logic for concurrency - Caires, Cardelli - 2001
18: System description: Twelf --- a meta-logical framework for deductive systems - Pfenning, Schurmann - 1999
17: Modal proofs as distributed programs (context) - Jia, Walker - 2003
BibTeX entry: (Update)
Carsten Schurmann and Frank Pfenning. A coverage checking algorithm for LF. In D. Basin and B. Wolff, editors, Proceedings of the 16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2003. http://citeseer.ist.psu.edu/schurmann03coverage.html More
@misc{ schurmann03coverage,
author = "C. Schurmann and F. Pfenning",
title = "A coverage checking algorithm for LF",
text = "Carsten Schurmann and Frank Pfenning. A coverage checking algorithm for
LF. In D. Basin and B. Wolff, editors, Proceedings of the 16th International
Conference on Theorem Proving in Higher Order Logics (TPHOLs 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/schurmann03coverage.html" }
Citations (may not include all citations):434 A framework for defining logics - Harper, Honsell et al. - 1993
251 A logic programming language with lambda-abstraction - Miller - 1991
174 A unification algorithm for typed #-calculus (context) - Huet - 1975
136 System description: Twelf --- a meta-logical framework for d.. - Pfenning, Schurmann - 1999
96 An algorithm for testing conversion in type theory (context) - Coquand - 1991
79 Pattern matching with dependent types (context) - Coquand - 1992
47 Logical frameworks - Pfenning - 1999
38 To appear - Pfenning, of et al. - 1992
37 Unification via explicit substitutions: The case of higher-o.. - Dowek, Hardin et al. - 1996
27 Mode and termination checking for higher-order logic program.. - Rohwedder, Pfenning - 1996
26 Information and Computation (context) - Pfenning, elimination et al. - 2000
25 Toward a foundational typed assembly language - Crary - 2003
24 Higher-Order Rewriting with Dependent Types - Virga - 1999
18 Dependently Typed Functional Programs and their Proofs - McBride - 1999
16 Partial inductive definitions (context) - Hallnas - 1991
16 Extensions and Applications of Higher-Order Unification (context) - Elliott - 1990
15 Automating the Meta Theory of Deductive Systems (context) - Schurmann - 2000
14 The groupoid model refutes uniqueness of identity proofs (context) - Hofmann, Streicher - 1994
12 Algorithms for equality and unification in the presence of n.. - Pfenning, Schurmann - 1998
11 Termination and reduction checking for higher-order logic pr.. - Pientka - 2083
8 Finitary Partial Inductive Definitions and General Logic (context) - Eriksson - 1993
8 Optimizing higher-order pattern unification - Pientka, Pfenning - 2003
8 Recursion for higher-order encodings (context) - Schurmann - 2001
7 A proof of normalization for simply typed lambda calculus wr.. (context) - Coquand - 1992
6 Rules of definitional reflection (context) - Schroeder-Heister - 1993
4 Delphin: Functional programming with deductive systems (context) - Schurmann, Fontana et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-2.cs.cmu.edu/~fp/papers/): More
A Type Theory for Memory Allocation and Data Layout - Petersen, Harper, Crary.. (2002) (Correct)
Trustless Grid Computing in ConCert - Chang, Crary, DeLap, Harper.. (2002) (Correct)
A Concurrent Logical Framework: The Propositional.. - Watkins, Cervesato.. (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC