Higher-order matching and tree automata

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

Volumn 1414, Issue , 1998, Pages 157-176

  Comon, Hubert ^a   Jurski, Yan ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957622091     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028013     Document Type: Conference Paper

References (13)

1. G. Dowek. A complete proof synthesis method for the cube of type systems. 3(3):287-315, 1993.
2. G. Dowek. Third order matching is decidable. Annals of Pure and Applied Logic, 1993.
3. G. Dowek. The undecidability of pattern matching in calculi where primitive recursive functions are representable. Theoretical Comput. Sci., 107:349-356, 1993.
4. M. Gecseg and M. Steinby. Tree Automata. Akademia Kiado, Budapest, 1984.
5. W. D. Goldfarb. Note on the undecidability of the second-order unification problem. Theoretical Comput. Set., 13:225-230, 1981.
6. R. Hindley and J. Seldin. Introduction to Combinators and X-calculus. Cambridge University Press, 1986.
7. G. Huet. Resolution d’equations dans les langages d’ordre 1, 2,… w. These d’Etat, Univ. Paris 7, 1976.
8. V. Padovani. Filtrage d’ordre superieur. PhD thesis, Universite de Paris VII, 1996.
9. A. Schubert. Linear interpolation for the higher order matching problem. In Proc. CAAP’97, Lille, 1997.
10. H. Seidl. Haskell overloading is DEXPTIME-complete. Inf. Process. Lett., 52:57-60, 1994.
11. J. Springintveld. Third-order matching in the polymorphic lambda calculus. In G. Dowek, J. Heering, K. Meinke, and B. Moller, editors, Proc. Higher-Order Algebra, Logic and Term Rewriting, volume 1074 of LNCS, Paderborn, Germany, September 1995. Springer-Verlag.
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.
13. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 134-191. Elsevier, 1990.