Computer Science – Logic in Computer Science
Scientific paper
2007-06-14
LMCS 3 (3:1) 2007
Computer Science
Logic in Computer Science
23 pages
Scientific paper
10.2168/LMCS-3(3:1)2007
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.
No associations
LandOfFree
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of<br> Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of<br> Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of<br> Automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-330909