Skip to main content
SpringerLink
Log in

On the Complexity of Higher-Order Matching in the Linear λ-Calculus

  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2706))

Included in the following conference series:

Abstract

We prove that linear second-order matching in the linear λ-calculus with linear occurrences of the unknowns is NP-complete. This result shows that context matching and second-order matching in the linear λ-calculus are, in fact, two different problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Comon. Completion of rewrite systems with membership constraints. Part I: Deduction rules. Journal of Symbolic Computation, 25(4):397–419, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  2. H. Comon. Completion of rewrite systems with membership constraints. Part II: Constraint solving. Journal of Symbolic Computation, 25(4):421–453, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  3. S. A. Cook. The complexity of theorem proving procedures. Proceedings of the 3rd annual ACM Symposium on Theory of Computing, pages 151–158, 1971.

    Google Scholar 

  4. D. Dougherty and T. Wierzbicki. A decidable variant of higher order matching. In Proc. 13th Conf. on Rewriting Techniques and Applications, RTA’02, volume 2378, pages 340–351, 2002.

    Article  MathSciNet  Google Scholar 

  5. G. Dowek. Third order matching is decidable. Annals of Pure and Applied Logic, 69(2–3):135–155, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  6. G. Dowek. Higher-order unification and matching. In A. Robinson and A. Voronkov (eds.), Handbook of Automated Reasoning, pp. 1009–1062, Elsevier, 2001.

    Google Scholar 

  7. W. D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13(2):225–230, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  8. Ph. de Groote. Higher-order linear matching is np-complete. Lecture Notes in Computer Science, 1833:127–140, 2000.

    Google Scholar 

  9. G. Huet. The undecidability of unification in third order logic. Information and Control, 22(3):257–267, 1973.

    Article  MathSciNet  MATH  Google Scholar 

  10. G. Huet. Résolution d’équations dans les langages d’ordre 1, 2,..., ω. Thèse de Doctorat d’Etat, Université Paris 7, 1976.

    Google Scholar 

  11. J. Levy. Linear second-order unification. In H. Ganzinger, editor, Rewriting Techniques and Applications, RTA’96, volume 1103 of Lecture Notes in Computer Science, pages 332–346. Springer-Verlag, 1996.

    Google Scholar 

  12. R. Loader. Higher order β matching is undecidable. Logic Journal of the IGPL, 11(1): 51–68, 2002.

    Article  MathSciNet  Google Scholar 

  13. V. Padovani. Filtrage d’ordre supérieure. Thèse de Doctorat, Université de Paris 7, 1996.

    Google Scholar 

  14. P. Kilpeläinen. Ordered and unordered tree inclusion. SIAM. J. Comput., 24(2): 340–356, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  15. M. Schmidt-Schauß and J. Stuber. On the complexity of linear and stratified context matching problems. Rapport de recherche A01-R-411, LORIA, December 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LORIA UMR no 7503 — INRIA, Campus Scientifique, B.P. 239, 54506, Vandoeuvre lès Nancy Cedex, France

    Sylvain Salvati & Philippe de Groote

Authors
  1. Sylvain Salvati
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Philippe de Groote
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dpt. Lenguajes y Sistemas Informáticos (LSI), Technical University of Catalonia (UPC), Jordi Girona 1, 08034, Barcelona, Spain

    Robert Nieuwenhuis

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salvati, S., de Groote, P. (2003). On the Complexity of Higher-Order Matching in the Linear λ-Calculus. In: Nieuwenhuis, R. (eds) Rewriting Techniques and Applications. RTA 2003. Lecture Notes in Computer Science, vol 2706. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44881-0_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-44881-0_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40254-1

  • Online ISBN: 978-3-540-44881-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation