Pientka, B. and Pfennning, F. 2003. Optimizing higher-order pattern unification. In International Conference on Automated Deduction, CADE'03, F. Baader, Ed. Lecture Notes in Computer Science (LNAI 2741). Springer, Miami, Florida, 473--487. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Contextual Model Type Theory - Nanevski, Pfenning, Pientka (2005) Self-citation (Pientka) (Correct)
No context found.
Pientka, B. and Pfennning, F. 2003. Optimizing higher-order pattern unification. In International Conference on Automated Deduction, CADE'03, F. Baader, Ed. Lecture Notes in Computer Science (LNAI 2741). Springer, Miami, Florida, 473--487.
Small proof witnesses for LF - Sarkar, Pientka, Crary (2005) Self-citation (Pientka) (Correct)
No context found.
Brigitte Pientka and Frank Pfennning. Optimizing higher-order pattern unification. In F. Baader, editor, 19th International Conference on Automated Deduction, Miami, USA, Lecture Notes in Artificial Intelligence (LNAI) 2741, pages 473--487. Springer-Verlag, July 2003.
A Modal Foundation for Meta-Variables - Aleksandar Nanevski Brigitte (2003) (1 citation) Self-citation (Pientka) (Correct)
No context found.
Brigitte Pientka and Frank Pfennning. Optimizing higher-order pattern unification. In F. Baader, editor, 19th International Conference on Automated Deduction, Miami, USA, Lecture Notes in Computer Science (LNAI 2741), pages 473--487. Springer, 2003. 12
A Modal Foundation for Meta-Variables - Nanevski, Pientka, Pfenning (2003) (1 citation) Self-citation (Pientka) (Correct)
No context found.
Brigitte Pientka and Frank Pfennning. Optimizing higher-order pattern unification. In F. Baader, editor, 19th International Conference on Automated Deduction, Miami, USA, Lecture Notes in Computer Science (LNAI 2741), pages 473--487. Springer, 2003. 12
Higher-Order Substitution Tree Indexing - Pientka (2003) (1 citation) Self-citation (Pientka) (Correct)
....a decidable fragment, called higher order patterns. For this fragment, unification and computing the most specific generalization is decidable even in rich type theories with dependent types and polymorphism as shown by Pfenning [12] However, these algorithms may not be efficient in practice [16] and hence it is not obvious that they are suitable for higher order term indexing techniques. In this paper, we present substitution tree indexing for higher order terms based on linear higher order patterns [16] Linear higher order patterns refine the notion of higher order patterns further ....
....shown by Pfenning [12] However, these algorithms may not be efficient in practice [16] and hence it is not obvious that they are suitable for higher order term indexing techniques. In this paper, we present substitution tree indexing for higher order terms based on linear higher order patterns [16]. Linear higher order patterns refine the notion of higher order patterns further and factor out any computationally expensive parts. As shown in [16] many terms encountered fall into this fragment and linear higher order pattern unification performs well in practice. In this paper, we give ....
[Article contains additional citation context not shown here]
Brigitte Pientka and Frank Pfennning. Optimizing higher-order pattern unification. In F. Baader, editor, 19th International Conference on Automated Deduction, Miami, USA, Lecture Notes in Computer Science (LNCS), to appear. Springer-Verlag, 2003.
A Coverage Checking Algorithm for LF - Schürmann, Pfenning (2003) (5 citations) Self-citation (Pfenning) (Correct)
....Intuitively, a coverage goal stands for all of its closed instances. In order to emphasize the interpretation of the variables as standing for closed terms, we write # for such contexts and denote variables in # by u and v rather than x and y. The distinction between # and # can be formalized (see [18]) but this is not necessary for the present purposes. A coverage problem is given by a goal and a set of patterns. One can think of these as the patterns of a case expression in a functional program, or the input terms in the clause heads of a logic program. In the general case, a set of ....
B. Pientka and F. Pfenning. Optimizing higher-order pattern unification. In F. Baader, editor, Proceedings of the 19th Conference on Automated Deduction (CADE-19), Miami Beach, Florida, July 2003. Springer-Verlag LNCS. To appear.
A Coverage Checking Algorithm for LF - Schürmann, Pfenning (2003) (5 citations) Self-citation (Pfenning) (Correct)
....Intuitively, a coverage goal stands for all of its closed instances. In order to emphasize the interpretation of the variables as standing for closed terms, we write # for such contexts and denote variables in # by u and v rather than x and y. The distinction between # and # can be formalized (see [21]) but this is not necessary for the present purposes. A coverage problem is given by a goal and a set of patterns. One can think of these as the patterns of a case expression in a functional program, or the input terms in the clause heads of a logic program. In the general case, a set of ....
B. Pientka and F. Pfenning. Optimizing higher-order pattern unification. Submitted, Jan. 2003.
A Meta Linear Logical Framework - McCreight, Schürmann (2003) (Correct)
No context found.
Brigitte Pientka and Frank Pfenning. Optimizing higher-order pattern unification. In CADE-19, Miami Beach, Florida, July 2003. To appear.
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