Decidability of arity-bounded higher-order matching

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

Volumn 2741, Issue , 2003, Pages 488-502

  Schmidt Schauß, Manfred ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; BIOINFORMATICS; THEOREM PROVING; ARTIFICIAL INTELLIGENCE; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; EQUIVALENCE CLASSES;

BEHAVIORAL EQUIVALENCE; BOUNDED MEAN; FREE VARIABLE; HIGHER-ORDER MATCHING; NORMAL FORM;

COMPUTABILITY AND DECIDABILITY;

ARITY-BOUNDED HIGHER-ORDER MATCHING; BEHAVIORAL EQUIVALENCE; FREE VARIABLES; LONGSTANDING OPEN PROBLEM;

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

References (20)

1. Henk P. Barendregt. The Lambda Calculus. Its Syntax and Semantics. North- Holland, Amsterdam, New York, 1984.
2. Hubert Comon and Yan Jurski. Higher-order matching and tree automata. In Proc. of CSL 97, volume 1414 of LNCS, pages 157-176, 1997.
3. Philippe de Groote. Linear higher-order matching is NP-complete. In Proceedings of the 11th Int. Conf. on Rewriting Techniques and Applications, volume 1833 of LNCS, pages 127-140. Springer-Verlag, 2000.
4. Gilles Dowek. Third order matching is decidable. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, pages 2-10, 1992.
5. Gilles Dowek. Higher-order unification and matching. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, volume 2, chapter 16, pages 1009-1062. North-Holland, 2001.
6. Dan Dougherty and ToMasz Wierzbicki. A decidable variant of higher order matching. In Proc. RTA’02, volume 2378 of LNCS, pages 340-351. Springer, 2002.
7. Gérard Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27-57, 1975.
8. Gérard Huet. Résolution d’équations dans des langages d’ordre 1,2,…ω. Thèse de doctorat d‘etat, Université Paris VII, 1976. In French. Loa 97.
9. R. Loader. An algorithm for the minimal model. Technical report, 1997. 4 pages, available on www.
10. Ralph Loader. Higher-order β matching is undecidable, 2001. draft. Mil 91.
11. Dale Miller. A logic programming language with lambda-abstraction, function variables and simple unification. J. of Logic and Computation, 1(4):497-536, 1991.
12. Tobias Nipkow. Higher-order critical pairs. In Proc. 6th IEEE Symp. LICS, pages 342-349, 1991.
13. Tobias Nipkow and Christian Prehofer. Higher-order rewriting and equational reasoning. In W. Bibel and P. Schmitt, editors, Automated Deduction — A Basis for Applications. Volume I: Foundations, volume 8 of Applied Logic Series, pages 399-430. Kluwer, 1998.
14. Vincent Padovani. On equivalence classes of interpolation equations. In M. Dezani-Ciancagliani and G. Plotkin, editors, Typed lambda-Calculi and Applications, volume 902 of LNCS, pages 335-349. Springer-Verlag, 1995.
15. Vincent Padovani. Decidability of all minimal models. In M. Coppo and S. Berardi, editors, Proc. Types for Proofs and Programs, volume 1158 of Lecture Notes in Computer Science, pages 201-215, 1996.
16. Vincent Padovani. Decidability of fourth-order matching. Mathematical Structures in Computer Science, 10(3):361-372, 2000.
17. Frank Pfenning. Logical frameworks. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, volume 2, chapter 17, pages 1063-1147. North-Holland, 2001.
18. Richard Statman. The typed λ-calculus is not elementary recursive. Theoretical Computer Science, 9:73-81, 1979.
19. ToMasz Wierzbicki. Complexity of the higher-order matching. In Proc. 16th CADE, number 1632 in LNCS, pages 82-96. Springer-Verlag, 1999.
20. David A. Wolfram. The clausal theories of types. Number 21 in Cambridge tracts in theoretical computer science. Cambridge University Press, 1993.