A decidable variant of higher order matching

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

Volumn 2378, Issue , 2002, Pages 340-351

  Dougherty, Dan ^a   Wierzbicki, Tomasz ^b  

^a WESLEYAN UNIVERSITY   (United States)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; DIFFERENTIATION (CALCULUS);

HIGHER-ORDER; HIGHER-ORDER MATCHING; LAMBDA CALCULUS; LAMBDA TERMS; LINEAR LAMBDA CALCULUS; PROBLEM INSTANCES;

CALCULATIONS;

EID: 84947239741     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45610-4_24     Document Type: Conference Paper

References (14)

1. Hubert Comon, Yan Jurski, Higher-Order Matching and Tree Automata, Proc. 11th Int’l Workshop Computer Science Logic, CSL’97, Mogens Nielsen, Wolfgang Thomas, eds., Aarhus, Denmark, August 1997, LNCS 1414, Springer-Verlag, 1998, 157–176.
2. Nachum Dershowitz, Zohar Manna, Provingtermination with multiset orderings, Comm. Assoc. for Computing Machinery, 6 (22), 465–476, 1979.
3. Giles Dowek, Third order matchingis decidable, Proc. 7th IEEE Symp. Logic in Computer Science, LICS’92, IEEE Press, 1992, 2–10, also in Annals of Pure and Applied Logic, 69, 1994, 135–155.
4. Philippe de Groote, Linear Higher-Order Matching Is NP-Complete, Proc. 11th Int’l Conf. Rewriting Techniques and Applications, RTA 2000, Leo Bachmair, ed., Norwich, UK, July 10–12, 2000, LNCS 1833, Springer-Verlag, 2000, 127–140.
5. Jordi Levy, Linear Second Order Unification, Proc. 7th Int’l Conf. Rewriting Techniques and Applications, RTA’96, H. Ganzinger, ed., New Brunswick, NJ, 1996, LNCS 1103, Springer-Verlag, 1996, 332–346.
6. Ralph Loader, Higher Order β Matching is Undecidable, October 2001, manuscript.
7. Harry G. Mairson, A Simple Proof of a Theorem of Statman, Theoretical Computer Science, 103, 1992, 213–226.
8. Vincent Padovani, Decidability of All Minimal Models, Proc. 3rd Int’l Workshop Types for Proofs and Programs, TYPES’95, Stefano Berardi, Mario Coppo, eds., Torino, Italy, 1995, LNCS 1158, Springer-Verlag, 1996, 201–215.
9. Vincent Padovani, On equivalence classes of interpolation equations, Proc.Int’l Conf. Typed Lambda Calculi and Applications, TLCA’95, M. Dezani-Ciancaglini, G. Plotkin, eds., LNCS 902, Springer-Verlag, 1995, 335–349.
10. Vincent Padovani, Decidability of fourth-order matching, Mathematical Structures in Computer Science, 3 (10), 2000, 361–372.
11. Manfred Schmidt-Schauß, Klaus U. Schulz, Decidability of bounded higher order unification, technical report Frank-report-15, Institut für Informatik, J. W. Goethe- Universität, Frankfurt am Main, 2001.
12. Aleksy Schubert, Linear interpolation for the higher order matching problem, Proc. 7th Int’l Joint Conf. Theory and Practice of Software Development, TAPSOFT’ 97, M. Bidoit, M. Dauchet, eds., LNCS 1214, Springer-Verlag, 1997.
13. Richard Statman, The Typed λ-Calculus is Not Elementary Recursive, Theoretical Computer Science, 15, 1981, 73–81.
14. Sergei Vorobyov, The“Hardest” Natural Decidable Theory, Proc. 12th Annual IEEE Symp. Logic in Computer Science, LICS’97, IEEE Press, 1997, 294–305.