A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of<br> Automata - Computer Science > Logic in Computer ScienceReportar como inadecuado




A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of<br> Automata - Computer Science > Logic in Computer Science - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Model checking properties are often described by means of finite automata.Any particular such automaton divides the set of infinite trees into finitelymany classes, according to which state has an infinite run. Building the fulltype hierarchy upon this interpretation of the base type gives a finitesemantics for simply-typed lambda-trees.A calculus based on this semantics is proven sound and complete. Inparticular, for regular infinite lambda-trees it is decidable whether a givenautomaton has a run or not. As regular lambda-trees are precisely recursionschemes, this decidability result holds for arbitrary recursion schemes ofarbitrary level, without any syntactical restriction.



Autor: Klaus Aehlig

Fuente: https://arxiv.org/



DESCARGAR PDF




Documentos relacionados