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

DOI10.1007/11874683_7zbMATH Open1225.68107arXiv0706.2076OpenAlexW1759451798MaRDI QIDQ3613331FDOQ3613331

Klaus Aehlig

Publication date: 12 March 2009

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

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.

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)

Cited In (1)

• Semantics of Higher-Order Recursion Schemes

   Recommendations

• A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata 👍 👎
• Title not available (Why is that?) 👍 👎
• Using models to model-check recursive schemes 👍 👎
• Simple Models for Recursive Schemes 👍 👎
• Using models to model-check recursive schemes 👍 👎

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)