| |
VOLUME 3, ISSUE 3, PAPER 1
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of
Automata
|
©Klaus Aehlig, University of Wales Swansea
|
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.
|
Publication date: July 4, 2007
Full Text: PDF | PostScript
DOI: 10.2168/LMCS-3(3:1)2007
Hit Counts: 3374 |
 Creative Commons | |
