A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
Author:
- Klaus AehligKAKlaus Aehlig
Preprint
Abstract
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.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Pushdown Processes: Games and Model-CheckingInformation and Computation, 2001
- On Full Abstraction for PCF: I, II, and IIIInformation and Computation, 2000
- The monadic second-order logic of graphs IX: Machines and their behavioursTheoretical Computer Science, 1995
- Decidability of second-order theories and automata on infinite trees.Transactions of the American Mathematical Society, 1969
- Intensional interpretations of functionals of finite type IThe Journal of Symbolic Logic, 1967