A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata

Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type hierarchy upon this interpretation of the base type gives a finite semantics for simply-typed lambda-trees. A calculus based on this semantics is proven sound and complete. In particular, for regular infinite lambda-trees it is decidable whether a given automaton has a run or not. As regular lambda-trees are precisely recursion schemes, this decidability result holds for arbitrary recursion schemes of arbitrary level, without any syntactical restriction. This partially solves an open problem of Knapik, Niwinski and Urzyczyn.

[1]  Klaus Aehlig,et al.  The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable , 2005, TLCA.

[2]  William W. Tait,et al.  Intensional interpretations of functionals of finite type I , 1967, Journal of Symbolic Logic.

[3]  Igor Walukiewicz.  Pushdown Processes: Games and Model-Checking , 2001, Inf. Comput..

[4]  Didier Caucal,et al.  On infinite transition graphs having a decidable monadic theory , 1996, Theor. Comput. Sci..

[5]  H. Barendregt.  The type free lambda calculus , 1977 .

[6]  Igor Walukiewicz,et al.  Unsafe Grammars and Panic Automata , 2005, ICALP.

[7]  Klaus Aehlig,et al.  On Continuous Normalization , 2002, CSL.

[8]  S. G. Simpson,et al.  The use of abstract language in elementary metamathematics: Some pedagogic examples , 1975 .

[9]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[10]  C.-H. Luke Ong,et al.  On Model-Checking Trees Generated by Higher-Order Recursion Schemes , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[11]  G. Mints,et al.  Finite investigations of transfinite derivations , 1978 .

[12]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs IX: Machines and their Behaviours , 1995, Theor. Comput. Sci..

[13]  Orna Kupferman,et al.  An Automata-Theoretic Approach to Reasoning about Infinite-State Systems , 2000, CAV.

[14]  C.-H. Luke Ong,et al.  On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..

[15]  Wilfried Buchholz,et al.  Notation systems for infinitary derivations , 1991, Arch. Math. Log..

[16]  Pawel Urzyczyn,et al.  Higher-Order Pushdown Trees Are Easy , 2002, FoSSaCS.

[17]  Pawel Urzyczyn,et al.  Deciding Monadic Theories of Hyperalgebraic Trees , 2001, TLCA.