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.

Source : oai:arXiv.org:0706.2076

DOI : 10.2168/LMCS-3(3:1)2007

Volume: Volume 3, Issue 3

Published on: July 4, 2007

Submitted on: November 24, 2006

Keywords: Computer Science - Logic in Computer Science,F.3.2

This page has been seen 61 times.

This article's PDF has been downloaded 16 times.