Skip to main content
SpringerLink
Log in

Higher-order matching and tree automata

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1997)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Dowek. A complete proof synthesis method for the cube of type systems. 3(3):287–315, 1993.

    Google Scholar 

  2. G. Dowek. Third order matching is decidable. Annals of Pure and Applied Logic, 1993.

    Google Scholar 

  3. G. Dowek. The undecidability of pattern matching in calculi where primitive recursive functions are representable. Theoretical Comput. Sci., 107:349–356, 1993.

    Article  Google Scholar 

  4. M. Gécseg and M. Steinby. Tree Automata. Akademia Kiadó, Budapest, 1984.

    Google Scholar 

  5. W. D. Goldfarb. Note on the undecidability of the second-order unification problem. Theoretical Comput. Sci., 13:225–230, 1981.

    Article  Google Scholar 

  6. R. Hindley and J. Seldin. Introduction to Combinators and λ-calculus. Cambridge University Press, 1986.

    Google Scholar 

  7. G. Huet. Résolution d'équations dans les langages d'ordre 1, 2...ω. Thèse d'Etat, Univ. Paris 7, 1976.

    Google Scholar 

  8. V. Padovani. Filtrage d'ordre supérieur. PhD thesis, University de Paris VII, 1996.

    Google Scholar 

  9. A. Schubert. Linear interpolation for the higher order matching problem. In Proc. CAAP'97, Lille, 1997.

    Google Scholar 

  10. H. Seidl. Haskell overloading is DEXPTIME-complete. Inf. Process. Lett., 52:57–60, 1994.

    Article  Google Scholar 

  11. J. Springintveld. Third-order matching in the polymorphic lambda calculus. In G. Dowek, J. Heering, K. Meinke, and B. Möller, editors, Proc. Higher-Order Algebra, Logic and Term Rewriting, volume 1074 of LNCS, Paderborn, Germany, September 1995. Springer-Verlag.

    Google Scholar 

  12. J. Springintveld. Third-order matching in the presence of type constructors. In M. Dezani-Ciancaglini and G. Plotkin, editors, Proc. 2nd Int. Conf. on Typed Lambda Calculi and Applications, volume 902 of LNCS, Edinburgh, United Kingdom, April 1995. Springer-Verlag.

    Google Scholar 

  13. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 134–191. Elsevier, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. URA 2236 du CNRS École Normale Supérieure de Cachan, Laboratoire Specification et Verification, 61 avenue du president Wilson, 94235, Cachan cedex, France

    Hubert Comon & Yan Jurski

Authors
  1. Hubert Comon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yan Jurski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Comon, H., Jurski, Y. (1998). Higher-order matching and tree automata. In: Nielsen, M., Thomas, W. (eds) Computer Science Logic. CSL 1997. Lecture Notes in Computer Science, vol 1414. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028013

Download citation

  • DOI: https://doi.org/10.1007/BFb0028013

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64570-2

  • Online ISBN: 978-3-540-69353-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation