Fully Abstract Normal Form Bisimulation for Call-by-Value PCF

Fully Abstract Normal Form Bisimulation for Call-by-Value PCF

We present the first fully abstract normal form bisimulation for call-by-value PCF (PCF\(_{\textsf{v}}\)). Our model is based on a labelled transition system (LTS) that combines elements from applicative bisimulation, environmental bisimulation and game semantics. In order to obtain completeness whi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2023-10
Hauptverfasser: Koutavas, Vasileios, Yu-Yang, Lin, Tzevelekos, Nikos
Format: Artikel
Sprache:eng
Schlagworte:
Canonical forms
Equivalence
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 Koutavas, Vasileios
Yu-Yang, Lin
Tzevelekos, Nikos
description We present the first fully abstract normal form bisimulation for call-by-value PCF (PCF\(_{\textsf{v}}\)). Our model is based on a labelled transition system (LTS) that combines elements from applicative bisimulation, environmental bisimulation and game semantics. In order to obtain completeness while avoiding the use of semantic quotiening, the LTS constructs traces corresponding to interactions with possible functional contexts. The model gives rise to a sound and complete technique for checking of PCF\(_{\textsf{v}}\) program equivalence, which we implement in a bounded bisimulation checking tool. We test our tool on known equivalences from the literature and new examples.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2871970879</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2871970879</sourcerecordid><originalsourceid>FETCH-proquest_journals_28719708793</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSwdSvNyalUcEwqLilKTC5R8Msvyk3MUXADUgpOmcWZuaU5iSWZ-XkKaflFCs6JOTm6SZW6YYk5pakKAc5uPAysaYk5xam8UJqbQdnNNcTZQ7egKL-wNLW4JD4rv7QoDygVb2RhbmhpbmBhbmlMnCoAFNQ3EQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2871970879</pqid></control><display><type>article</type><title>Fully Abstract Normal Form Bisimulation for Call-by-Value PCF</title><source>Free E- Journals</source><creator>Koutavas, Vasileios ; Yu-Yang, Lin ; Tzevelekos, Nikos</creator><creatorcontrib>Koutavas, Vasileios ; Yu-Yang, Lin ; Tzevelekos, Nikos</creatorcontrib><description>We present the first fully abstract normal form bisimulation for call-by-value PCF (PCF\(_{\textsf{v}}\)). Our model is based on a labelled transition system (LTS) that combines elements from applicative bisimulation, environmental bisimulation and game semantics. In order to obtain completeness while avoiding the use of semantic quotiening, the LTS constructs traces corresponding to interactions with possible functional contexts. The model gives rise to a sound and complete technique for checking of PCF\(_{\textsf{v}}\) program equivalence, which we implement in a bounded bisimulation checking tool. We test our tool on known equivalences from the literature and new examples.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Canonical forms ; Equivalence ; Semantics</subject><ispartof>arXiv.org, 2023-10</ispartof><rights>2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</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>780,784</link.rule.ids></links><search><creatorcontrib>Koutavas, Vasileios</creatorcontrib><creatorcontrib>Yu-Yang, Lin</creatorcontrib><creatorcontrib>Tzevelekos, Nikos</creatorcontrib><title>Fully Abstract Normal Form Bisimulation for Call-by-Value PCF</title><title>arXiv.org</title><description>We present the first fully abstract normal form bisimulation for call-by-value PCF (PCF\(_{\textsf{v}}\)). Our model is based on a labelled transition system (LTS) that combines elements from applicative bisimulation, environmental bisimulation and game semantics. In order to obtain completeness while avoiding the use of semantic quotiening, the LTS constructs traces corresponding to interactions with possible functional contexts. The model gives rise to a sound and complete technique for checking of PCF\(_{\textsf{v}}\) program equivalence, which we implement in a bounded bisimulation checking tool. We test our tool on known equivalences from the literature and new examples.</description><subject>Canonical forms</subject><subject>Equivalence</subject><subject>Semantics</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSwdSvNyalUcEwqLilKTC5R8Msvyk3MUXADUgpOmcWZuaU5iSWZ-XkKaflFCs6JOTm6SZW6YYk5pakKAc5uPAysaYk5xam8UJqbQdnNNcTZQ7egKL-wNLW4JD4rv7QoDygVb2RhbmhpbmBhbmlMnCoAFNQ3EQ</recordid><startdate>20231002</startdate><enddate>20231002</enddate><creator>Koutavas, Vasileios</creator><creator>Yu-Yang, Lin</creator><creator>Tzevelekos, Nikos</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></search><sort><creationdate>20231002</creationdate><title>Fully Abstract Normal Form Bisimulation for Call-by-Value PCF</title><author>Koutavas, Vasileios ; Yu-Yang, Lin ; Tzevelekos, Nikos</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_28719708793</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Canonical forms</topic><topic>Equivalence</topic><topic>Semantics</topic><toplevel>online_resources</toplevel><creatorcontrib>Koutavas, Vasileios</creatorcontrib><creatorcontrib>Yu-Yang, Lin</creatorcontrib><creatorcontrib>Tzevelekos, Nikos</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></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Koutavas, Vasileios</au><au>Yu-Yang, Lin</au><au>Tzevelekos, Nikos</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Fully Abstract Normal Form Bisimulation for Call-by-Value PCF</atitle><jtitle>arXiv.org</jtitle><date>2023-10-02</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>We present the first fully abstract normal form bisimulation for call-by-value PCF (PCF\(_{\textsf{v}}\)). Our model is based on a labelled transition system (LTS) that combines elements from applicative bisimulation, environmental bisimulation and game semantics. In order to obtain completeness while avoiding the use of semantic quotiening, the LTS constructs traces corresponding to interactions with possible functional contexts. The model gives rise to a sound and complete technique for checking of PCF\(_{\textsf{v}}\) program equivalence, which we implement in a bounded bisimulation checking tool. We test our tool on known equivalences from the literature and new examples.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2023-10
issn 2331-8422
language eng
recordid cdi_proquest_journals_2871970879
source Free E- Journals
subjects Canonical forms
Equivalence
Semantics
title Fully Abstract Normal Form Bisimulation for Call-by-Value PCF
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T22%3A35%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Fully%20Abstract%20Normal%20Form%20Bisimulation%20for%20Call-by-Value%20PCF&rft.jtitle=arXiv.org&rft.au=Koutavas,%20Vasileios&rft.date=2023-10-02&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2871970879%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2871970879&rft_id=info:pmid/&rfr_iscdi=true