Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 2004: Computer Science Logic pp 220–234Cite as

Higher-Order Matching in the Linear λ-calculus with Pairing

  • Conference paper
  • First Online:

  • 516 Accesses

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

Abstract

We prove that higher-order matching in the linear λ-calculus with pairing is decidable. We also establish its NP-completeness under the assumption that the right-hand side of the equation to be solved is given in normal form.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  4. Dougherty, D., Wierzbicki, T.: A decidable variant of higher order matching. In: Tison, S. (ed.) RTA 2002. LNCS, vol. 2378, pp. 340–351. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Chapter  Google Scholar 

  7. Girard, J.Y.: Linear logic. Theoritical Computer Science 50, 1–102 (1987)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. de Groote, P.h.: Higher-order linear matching is NP-complete. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol. 1833, pp. 127–140. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. de Groote, P.h., Salvati, S.: On the complexity of higher-order matching in the linear. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 234–245. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  12. Huet, G.: R´esolution d’´equations dans les langages d’ordre 1, 2,..., ω. Thèse de Doctorat d’Etat, Université Paris 7 (1976)

    Google Scholar 

  13. Levy, J.: Linear second-order unification. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol. 1103, pp. 332–346. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  15. Mairson, H., Terui, K.: On the Computational Complexity of Cut-Elimination in Linear Logic. In: Blundo, C., Laneve, C. (eds.) ICTCS 2003. LNCS, vol. 2841, pp. 23–36. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. Padovani, V.: Filtrage d’ordre sup´erieure. Thèse de Doctorat, Université de Paris 7 (1996)

    Google Scholar 

  17. Schmidt-Schauß, M., Stuber, J.: 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 n° 7503 - INRIA, Campus Scientifique, B.P. 239, 54506 Cedex, Vandœuvre lès Nancy, France

    Philippe de Groote & Sylvain Salvati

Authors
  1. Philippe de Groote
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sylvain Salvati
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Wroclaw University, Poland

    Jerzy Marcinkowski

  2. Polish Academy of Sciences, Institute of Computer Science, Poland

    Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Groote, P., Salvati, S. (2004). Higher-Order Matching in the Linear λ-calculus with Pairing. In: Marcinkowski, J., Tarlecki, A. (eds) Computer Science Logic. CSL 2004. Lecture Notes in Computer Science, vol 3210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30124-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30124-0_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23024-3

  • Online ISBN: 978-3-540-30124-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation