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

DOI10.1007/11874683_7MaRDI QIDQ3613331zbMATH OpenOpenAlexFDO

Authors Klaus Aehlig

Publication date 12 March 2009

Published in Computer Science Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0706.2076

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40)

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.

Recommendations

• A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
• Higher-order parity automata
• Using models to model-check recursive schemes
• Simple Models for Recursive Schemes
• Using models to model-check recursive schemes

Cited in

(5)

• Using models to model-check recursive schemes
• Recognizability in the Simply Typed Lambda-Calculus
• A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
• Using models to model-check recursive schemes
• Higher-order parity automata

This page was built for publication: A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613331)