Optimizing higher-order pattern unification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2741, Issue , 2003, Pages 473-487

  Pientka, Brigitte ^a   Pfenning, Frank ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); THEOREM PROVING; CODES (SYMBOLS); COMPUTATIONAL METHODS; LINEARIZATION; MODAL ANALYSIS; OPTIMIZATION; PATTERN RECOGNITION;

HIGHER-ORDER; HIGHER-ORDER UNIFICATION; PATTERN UNIFICATION; PROOF-CARRYING CODE; TYPE THEORY; TYPED LAMBDA CALCULUS; EXISTENTIAL VARIABLES; HIGHER-ORDER PATTERN UNIFICATION; LAMBDA-CALCULUS; MODAL TYPE THEORY;

AUTOMATION; COMPUTATION THEORY;

EID: 7044270614     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45085-6_40     Document Type: Conference Paper

References (16)

1. Andrew Appel. Foundational proof-carrying code. In J. Halpern, editor, Proceedings of the 16th Annual Symposium on Logic in Computer Science (LICS’01), pages 247-256. IEEE Computer Society Press, June 2001. Invited Talk.
2. Pascal Brisset and Olivier Ridoux. Naive reverse can be linear. In Koichi Furukawa, editor, International Conference on Logic Programming, pages 857-870, Paris, France, June 1991. MIT Press.
3. Gilles Dowek, Thérèse Hardin, Claude Kirchner, and Frank Pfenning. Unification via explicit substitutions: The case of higher-order patterns. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 259-273, Bonn, Germany, September 1996. MIT Press.
4. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993.
5. Gérard Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27-57, 1975.
6. Dale Miller. Unification of simply typed lambda-terms as logic programming. In Eighth International Logic Programming Conference, pages 255-269, Paris, France, June 1991. MIT Press.
7. Gopalan Nadathur. A treatment of higher-order features in logic programming. Technical Report draft, available upon request, Department of Computer Science and Engineering, University of Minnesota, January 2003.
8. Gopalan Nadathur, Bharat Jayaraman, and Debra Sue Wilson. Implementation considerations for higher-order features in logic programming. Technical Report CS-1993-16, Department of Computer Science, Duke University, June 1993.
9. Gopalan Nadathur and Dale Miller. An overview of λProlog. In Kenneth A. Bowen and Robert A. Kowalski, editors, Fifth International Logic Programming Conference, pages 810-827, Seattle, Washington, August 1988. MIT Press.
10. Gopalan Nadathur and Dustin J. Mitchell. System description: Teyjus—a compiler and abstract machine based implementation of lambda prolog. In H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction (CADE-16), pages 287-291, Trento, Italy, July 1999. Springer-Verlag LNCS.
11. George C. Necula and Peter Lee. Efficient representation and validation of logical proofs. In Vaughan Pratt, editor, Proceedings of the 13th Annual Symposium on Logic in Computer Science (LICS’98), pages 93-104, Indianapolis, Indiana, June 1998. IEEE Computer Society Press.
12. Lawrence C. Paulson. Natural deduction as higher-order resolution. Journal of Logic Programming, 3:237-258, 1986.
13. Frank Pfenning. Unification and anti-unification in the Calculus of Constructions. In Sixth Annual IEEE Symposium on Logic in Computer Science, pages 74-85, Amsterdam, The Netherlands, July 1991.
14. Frank Pfenning and Rowan Davies. A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science, 11:511-540, 2001. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA’99), Trento, Italy, July 1999.
15. Frank Pfenning and Carsten Schürmann. System description: Twelf — a metalogical framework for deductive systems. In H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction (CADE-16), pages 202-206, Trento, Italy, July 1999. Springer-Verlag, Lecture Notes in Artificial Intelligence (LNAI) 1632.
16. Jeff Polakow and Frank Pfenning. Ordered linear logic programming. Technical Report CMU-CS-98-183, Department of Computer Science, Carnegie Mellon University, December 1998.