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.
KeywordsNormal Form Model Check Ground Type Recursion Scheme Lambda Calculus
Unable to display preview. Download preview PDF.
- 8.Mints, G.E.: Finite investigations of transfinite derivations. Journal of Soviet Mathematics, 10, 548–596 (1978); Translated from: Zap. Nauchn. Semin. LOMI 49 (1975); Cited after Grigori Mints. Selected papers in Proof Theory. Studies in Proof Theory. Bibliopolis (1992)Google Scholar
- 9.Ong, C.-H.L.: On model-checking trees generated by higher-order recursion schemes. In: Proceedings of the Twenty First Annual IEEE Symposium on Logic in Computer Science (LICS 2006) (to appear, 2006)Google Scholar