Advertisement

Introduction to Decidability of Higher-Order Matching

  • Colin Stirling
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6014)

Abstract

Higher-order unification is the problem given an equation t = u containing free variables is there a solution substitution θ such that t θ and u θ have the same normal form? The terms t and u are from the simply typed lambda calculus and the same normal form is with respect to βη-equivalence. Higher-order matching is the particular instance when the term u is closed; can t be pattern matched to u? Although higher-order unification is undecidable, higher-order matching was conjectured to be decidable by Huet [2]. Decidability was shown in [7] via a game-theoretic analysis of β-reduction when component terms are in η-long normal form.

In the talk we outline the proof of decidability. Besides the use of games to understand β-reduction, we also emphasize how tree automata can recognize terms of simply typed lambda calculus as developed in [1, 3-6].

References

  1. 1.
    Comon, H., Jurski, Y.: Higher-order matching and tree automata. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol. 1414, pp. 157–176. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  2. 2.
    Huet, G.: Rèsolution d’èquations dans les langages d’ordre 1, 2, ... ω. Thèse de doctorat d’ètat, Universitè Paris VII (1976)Google Scholar
  3. 3.
    Ong, C.-H.L.: On model-checking trees generated by higher-order recursion schemes. In: Procs. LICS 2006, pp. 81–90 (2006)Google Scholar
  4. 4.
    Ong, C.-H.L., Tzevelekos: Functional reachability. In: Procs. LICS 2009, pp. 286–295 (2009)Google Scholar
  5. 5.
    Stirling, C.: Higher-order matching, games and automata. In: Procs. LICS 2007, pp. 326–335 (2007)Google Scholar
  6. 6.
    Stirling, C.: Dependency tree automata. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 92–106. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  7. 7.
    Stirling, C.: Decidability of higher-order matching. Logical Methods in Computer Science 5(3:2), 1–52 (2009)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Colin Stirling
    • 1
  1. 1.School of InformaticsUniversity of Edinburgh 

Personalised recommendations