A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST

A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST

We present a logical relations model of a higher-order functional programming language with impredicative polymorphism, recursive types, and a Haskell-style ST monad type with runST. We use our logical relations model to show that runST provides proper encapsulation of state, by showing that effectf...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of ACM on programming languages 2018-01, Vol.2 (POPL), p.1-28
Hauptverfasser: Timany, Amin, Stefanesco, Léo, Krogh-Jespersen, Morten, Birkedal, Lars
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 28
container_issue POPL
container_start_page 1
container_title Proceedings of ACM on programming languages
container_volume 2
creator Timany, Amin
Stefanesco, Léo
Krogh-Jespersen, Morten
Birkedal, Lars
description We present a logical relations model of a higher-order functional programming language with impredicative polymorphism, recursive types, and a Haskell-style ST monad type with runST. We use our logical relations model to show that runST provides proper encapsulation of state, by showing that effectful computations encapsulated by runST are heap independent. Furthermore, we show that contextual refinements and equivalences that are expected to hold for pure computations do indeed hold in the presence of runST. This is the first time such relational results have been proven for a language with monadic encapsulation of state. We have formalized all the technical development and results in Coq.
doi_str_mv 10.1145/3158152
format Article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1145_3158152</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1145_3158152</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2392-19f7c84bce215e3694dc4c8210284d80ba6277aca615e8a468f74d65b1ccdca83</originalsourceid><addsrcrecordid>eNpNkM1OwzAQhC0EElWpeAXfOAW8tpM43KqKP6kSB8o52m6cYpTaxU4qeHtSkQOnHe3MN4dh7BrELYDO7xTkBnJ5xmZSl3kGWsL5P33JFil9CiGgUtqoasbCkndh5wg7Hm2HvQuetyHyffDYOOLWEx7SMDmh5anH3t7zQwxH53ecgu_tdz-MvP0a3BG7kbCJO8_7DzvGbDo9TmQc_Nvmil202CW7mO6cvT8-bFbP2fr16WW1XGckVSUzqNqSjN6SlZBbVVS6IU1GgpBGN0ZssZBliYTFaBvUhWlL3RT5FogaQqPm7Oavl2JIKdq2PkS3x_hTg6hPU9XTVOoXwLZcVw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST</title><source>ACM Digital Library Complete</source><source>EZB Electronic Journals Library</source><creator>Timany, Amin ; Stefanesco, Léo ; Krogh-Jespersen, Morten ; Birkedal, Lars</creator><creatorcontrib>Timany, Amin ; Stefanesco, Léo ; Krogh-Jespersen, Morten ; Birkedal, Lars</creatorcontrib><description>We present a logical relations model of a higher-order functional programming language with impredicative polymorphism, recursive types, and a Haskell-style ST monad type with runST. We use our logical relations model to show that runST provides proper encapsulation of state, by showing that effectful computations encapsulated by runST are heap independent. Furthermore, we show that contextual refinements and equivalences that are expected to hold for pure computations do indeed hold in the presence of runST. This is the first time such relational results have been proven for a language with monadic encapsulation of state. We have formalized all the technical development and results in Coq.</description><identifier>ISSN: 2475-1421</identifier><identifier>EISSN: 2475-1421</identifier><identifier>DOI: 10.1145/3158152</identifier><language>eng</language><ispartof>Proceedings of ACM on programming languages, 2018-01, Vol.2 (POPL), p.1-28</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2392-19f7c84bce215e3694dc4c8210284d80ba6277aca615e8a468f74d65b1ccdca83</citedby><cites>FETCH-LOGICAL-c2392-19f7c84bce215e3694dc4c8210284d80ba6277aca615e8a468f74d65b1ccdca83</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27922,27923</link.rule.ids></links><search><creatorcontrib>Timany, Amin</creatorcontrib><creatorcontrib>Stefanesco, Léo</creatorcontrib><creatorcontrib>Krogh-Jespersen, Morten</creatorcontrib><creatorcontrib>Birkedal, Lars</creatorcontrib><title>A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST</title><title>Proceedings of ACM on programming languages</title><description>We present a logical relations model of a higher-order functional programming language with impredicative polymorphism, recursive types, and a Haskell-style ST monad type with runST. We use our logical relations model to show that runST provides proper encapsulation of state, by showing that effectful computations encapsulated by runST are heap independent. Furthermore, we show that contextual refinements and equivalences that are expected to hold for pure computations do indeed hold in the presence of runST. This is the first time such relational results have been proven for a language with monadic encapsulation of state. We have formalized all the technical development and results in Coq.</description><issn>2475-1421</issn><issn>2475-1421</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNpNkM1OwzAQhC0EElWpeAXfOAW8tpM43KqKP6kSB8o52m6cYpTaxU4qeHtSkQOnHe3MN4dh7BrELYDO7xTkBnJ5xmZSl3kGWsL5P33JFil9CiGgUtqoasbCkndh5wg7Hm2HvQuetyHyffDYOOLWEx7SMDmh5anH3t7zQwxH53ecgu_tdz-MvP0a3BG7kbCJO8_7DzvGbDo9TmQc_Nvmil202CW7mO6cvT8-bFbP2fr16WW1XGckVSUzqNqSjN6SlZBbVVS6IU1GgpBGN0ZssZBliYTFaBvUhWlL3RT5FogaQqPm7Oavl2JIKdq2PkS3x_hTg6hPU9XTVOoXwLZcVw</recordid><startdate>20180101</startdate><enddate>20180101</enddate><creator>Timany, Amin</creator><creator>Stefanesco, Léo</creator><creator>Krogh-Jespersen, Morten</creator><creator>Birkedal, Lars</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20180101</creationdate><title>A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST</title><author>Timany, Amin ; Stefanesco, Léo ; Krogh-Jespersen, Morten ; Birkedal, Lars</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2392-19f7c84bce215e3694dc4c8210284d80ba6277aca615e8a468f74d65b1ccdca83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Timany, Amin</creatorcontrib><creatorcontrib>Stefanesco, Léo</creatorcontrib><creatorcontrib>Krogh-Jespersen, Morten</creatorcontrib><creatorcontrib>Birkedal, Lars</creatorcontrib><collection>CrossRef</collection><jtitle>Proceedings of ACM on programming languages</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Timany, Amin</au><au>Stefanesco, Léo</au><au>Krogh-Jespersen, Morten</au><au>Birkedal, Lars</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST</atitle><jtitle>Proceedings of ACM on programming languages</jtitle><date>2018-01-01</date><risdate>2018</risdate><volume>2</volume><issue>POPL</issue><spage>1</spage><epage>28</epage><pages>1-28</pages><issn>2475-1421</issn><eissn>2475-1421</eissn><abstract>We present a logical relations model of a higher-order functional programming language with impredicative polymorphism, recursive types, and a Haskell-style ST monad type with runST. We use our logical relations model to show that runST provides proper encapsulation of state, by showing that effectful computations encapsulated by runST are heap independent. Furthermore, we show that contextual refinements and equivalences that are expected to hold for pure computations do indeed hold in the presence of runST. This is the first time such relational results have been proven for a language with monadic encapsulation of state. We have formalized all the technical development and results in Coq.</abstract><doi>10.1145/3158152</doi><tpages>28</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2475-1421
ispartof Proceedings of ACM on programming languages, 2018-01, Vol.2 (POPL), p.1-28
issn 2475-1421
2475-1421
language eng
recordid cdi_crossref_primary_10_1145_3158152
source ACM Digital Library Complete; EZB Electronic Journals Library
title A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T17%3A11%3A30IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20logical%20relation%20for%20monadic%20encapsulation%20of%20state:%20proving%20contextual%20equivalences%20in%20the%20presence%20of%20runST&rft.jtitle=Proceedings%20of%20ACM%20on%20programming%20languages&rft.au=Timany,%20Amin&rft.date=2018-01-01&rft.volume=2&rft.issue=POPL&rft.spage=1&rft.epage=28&rft.pages=1-28&rft.issn=2475-1421&rft.eissn=2475-1421&rft_id=info:doi/10.1145/3158152&rft_dat=%3Ccrossref%3E10_1145_3158152%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true