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

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

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 fini...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2007-11
1. Verfasser: Aehlig, Klaus
Format: Artikel
Sprache:eng
Schlagworte:
Automata theory
Computer Science - Logic in Computer Science
Semantics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Aehlig, Klaus
description 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.
doi_str_mv 10.48550/arxiv.0706.2076
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_0706_2076</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2083166843</sourcerecordid><originalsourceid>FETCH-LOGICAL-a513-d9146c9a854f8c87854e2204c43eb29d6bccea6da9b9ba52872290fd86fd44623</originalsourceid><addsrcrecordid>eNotj0tLw0AUhQdBsNTuXcmA68TJnUcmy1CsFiKCzT7cZGYgpXk4ScT8e9PH6izOdy_nI-QpYqHQUrJX9H_1b8hipkJgsbojK-A8CrQAeCCbYTgyxkDFICVfkc-U7uq2Hi092Abbsa4G2jl6qJv-NAf53FtDM2xKgzS3vhmo6zzdt-568z21Fzydxq7BER_JvcPTYDe3XJN895ZvP4Ls632_TbMAZcQDk0RCVQlqKZyudLykBWCiEtyWkBhVVpVFZTApkxIl6BggYc5o5YwQCviaPF_fXlSL3tcN-rk4Kxdn5QV4uQK9734mO4zFsZt8u0xaes0jpbTg_B-kElgS</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2083166843</pqid></control><display><type>article</type><title>A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata</title><source>Freely Accessible Journals</source><source>arXiv.org</source><creator>Aehlig, Klaus</creator><creatorcontrib>Aehlig, Klaus</creatorcontrib><description>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.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.0706.2076</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Automata theory ; Computer Science - Logic in Computer Science ; Semantics</subject><ispartof>arXiv.org, 2007-11</ispartof><rights>Notwithstanding the ProQuest Terms and conditions, you may use this content in accordance with the associated terms available at http://arxiv.org/abs/0706.2076.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27902</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.0706.2076$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.2168/LMCS-3(3:1)2007$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Aehlig, Klaus</creatorcontrib><title>A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata</title><title>arXiv.org</title><description>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.</description><subject>Automata theory</subject><subject>Computer Science - Logic in Computer Science</subject><subject>Semantics</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotj0tLw0AUhQdBsNTuXcmA68TJnUcmy1CsFiKCzT7cZGYgpXk4ScT8e9PH6izOdy_nI-QpYqHQUrJX9H_1b8hipkJgsbojK-A8CrQAeCCbYTgyxkDFICVfkc-U7uq2Hi092Abbsa4G2jl6qJv-NAf53FtDM2xKgzS3vhmo6zzdt-568z21Fzydxq7BER_JvcPTYDe3XJN895ZvP4Ls632_TbMAZcQDk0RCVQlqKZyudLykBWCiEtyWkBhVVpVFZTApkxIl6BggYc5o5YwQCviaPF_fXlSL3tcN-rk4Kxdn5QV4uQK9734mO4zFsZt8u0xaes0jpbTg_B-kElgS</recordid><startdate>20071101</startdate><enddate>20071101</enddate><creator>Aehlig, Klaus</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20071101</creationdate><title>A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata</title><author>Aehlig, Klaus</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a513-d9146c9a854f8c87854e2204c43eb29d6bccea6da9b9ba52872290fd86fd44623</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Automata theory</topic><topic>Computer Science - Logic in Computer Science</topic><topic>Semantics</topic><toplevel>online_resources</toplevel><creatorcontrib>Aehlig, Klaus</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Aehlig, Klaus</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata</atitle><jtitle>arXiv.org</jtitle><date>2007-11-01</date><risdate>2007</risdate><eissn>2331-8422</eissn><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.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.0706.2076</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2007-11
issn 2331-8422
language eng
recordid cdi_arxiv_primary_0706_2076
source Freely Accessible Journals; arXiv.org
subjects Automata theory
Computer Science - Logic in Computer Science
Semantics
title A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T07%3A14%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Finite%20Semantics%20of%20Simply-Typed%20Lambda%20Terms%20for%20Infinite%20Runs%20of%20Automata&rft.jtitle=arXiv.org&rft.au=Aehlig,%20Klaus&rft.date=2007-11-01&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.0706.2076&rft_dat=%3Cproquest_arxiv%3E2083166843%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2083166843&rft_id=info:pmid/&rfr_iscdi=true