Behavioral equivalence in the polymorphic pi-calculus
We investigate parametric polymorphism in message-based concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambda-calculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly manipul...
Gespeichert in:
| Veröffentlicht in: | Journal of the ACM 2000-05, Vol.47 (3), p.531-584 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 584 |
|---|---|
| container_issue | 3 |
| container_start_page | 531 |
| container_title | Journal of the ACM |
| container_volume | 47 |
| creator | Pierce, Benjamin C Sangiorgi, Davide |
| description | We investigate parametric polymorphism in message-based concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambda-calculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly manipulating data values whose types are abstract, leading to notions of equivalence much coarser than the standard untyped ones. We study the nature of these constraints through simple examples of concurrent abstract data types and develop basic theoretical machinery for establishing bisimilarity of polymorphic processes. We also observe some surprising interactions between polymorphism and aliasing, drawing examples from both the polymorphic pi-calculus and ML. |
| doi_str_mv | 10.1145/337244.337261 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_28888839</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1808125401</sourcerecordid><originalsourceid>FETCH-LOGICAL-c431t-d83c85513f55ca509449ef394286d3fec87d2aa2da9356ac0596b9903ff509f43</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhoMoWKtH74sH8ZKaycductTiFxS8KHgLMZvQlHR3m3QL_ffusp48OJeXgYeXmQehayALAC7uGaso54sxSjhBMxCiwhUTX6doRgjhWHCAc3SR82ZYCSXVDIlHtzaH0CYTC7frw8FE11hXhKbYr13RtfG4bVO3DrboArYm2j72-RKdeROzu_rNOfp8fvpYvuLV-8vb8mGFLWewx7VkVgoBzAthjSCKc-U8U5zKsmbeWVnV1BhaG8VEaSwRqvxWijDvB9hzNke3U2-X2l3v8l5vQ7YuRtO4ts-aynGYGsC7f0GQRAIVnMCA3vxBN22fmuENDcNllMlq7MMTZFObc3JedylsTTpqIHqUrSfZepLNfgDIQW9A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>194223879</pqid></control><display><type>article</type><title>Behavioral equivalence in the polymorphic pi-calculus</title><source>ACM Digital Library</source><creator>Pierce, Benjamin C ; Sangiorgi, Davide</creator><creatorcontrib>Pierce, Benjamin C ; Sangiorgi, Davide</creatorcontrib><description>We investigate parametric polymorphism in message-based concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambda-calculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly manipulating data values whose types are abstract, leading to notions of equivalence much coarser than the standard untyped ones. We study the nature of these constraints through simple examples of concurrent abstract data types and develop basic theoretical machinery for establishing bisimilarity of polymorphic processes. We also observe some surprising interactions between polymorphism and aliasing, drawing examples from both the polymorphic pi-calculus and ML.</description><identifier>ISSN: 0004-5411</identifier><identifier>EISSN: 1557-735X</identifier><identifier>DOI: 10.1145/337244.337261</identifier><identifier>CODEN: JACOAH</identifier><language>eng</language><publisher>New York: Association for Computing Machinery</publisher><subject>Calculus ; Equivalence ; Mathematical analysis ; Observers ; Polymorphism ; Programming ; Programming languages ; Studies ; Theory</subject><ispartof>Journal of the ACM, 2000-05, Vol.47 (3), p.531-584</ispartof><rights>Copyright Association for Computing Machinery May 2000</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c431t-d83c85513f55ca509449ef394286d3fec87d2aa2da9356ac0596b9903ff509f43</citedby><cites>FETCH-LOGICAL-c431t-d83c85513f55ca509449ef394286d3fec87d2aa2da9356ac0596b9903ff509f43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Pierce, Benjamin C</creatorcontrib><creatorcontrib>Sangiorgi, Davide</creatorcontrib><title>Behavioral equivalence in the polymorphic pi-calculus</title><title>Journal of the ACM</title><description>We investigate parametric polymorphism in message-based concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambda-calculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly manipulating data values whose types are abstract, leading to notions of equivalence much coarser than the standard untyped ones. We study the nature of these constraints through simple examples of concurrent abstract data types and develop basic theoretical machinery for establishing bisimilarity of polymorphic processes. We also observe some surprising interactions between polymorphism and aliasing, drawing examples from both the polymorphic pi-calculus and ML.</description><subject>Calculus</subject><subject>Equivalence</subject><subject>Mathematical analysis</subject><subject>Observers</subject><subject>Polymorphism</subject><subject>Programming</subject><subject>Programming languages</subject><subject>Studies</subject><subject>Theory</subject><issn>0004-5411</issn><issn>1557-735X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2000</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LAzEQhoMoWKtH74sH8ZKaycductTiFxS8KHgLMZvQlHR3m3QL_ffusp48OJeXgYeXmQehayALAC7uGaso54sxSjhBMxCiwhUTX6doRgjhWHCAc3SR82ZYCSXVDIlHtzaH0CYTC7frw8FE11hXhKbYr13RtfG4bVO3DrboArYm2j72-RKdeROzu_rNOfp8fvpYvuLV-8vb8mGFLWewx7VkVgoBzAthjSCKc-U8U5zKsmbeWVnV1BhaG8VEaSwRqvxWijDvB9hzNke3U2-X2l3v8l5vQ7YuRtO4ts-aynGYGsC7f0GQRAIVnMCA3vxBN22fmuENDcNllMlq7MMTZFObc3JedylsTTpqIHqUrSfZepLNfgDIQW9A</recordid><startdate>20000501</startdate><enddate>20000501</enddate><creator>Pierce, Benjamin C</creator><creator>Sangiorgi, Davide</creator><general>Association for Computing Machinery</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20000501</creationdate><title>Behavioral equivalence in the polymorphic pi-calculus</title><author>Pierce, Benjamin C ; Sangiorgi, Davide</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c431t-d83c85513f55ca509449ef394286d3fec87d2aa2da9356ac0596b9903ff509f43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Calculus</topic><topic>Equivalence</topic><topic>Mathematical analysis</topic><topic>Observers</topic><topic>Polymorphism</topic><topic>Programming</topic><topic>Programming languages</topic><topic>Studies</topic><topic>Theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Pierce, Benjamin C</creatorcontrib><creatorcontrib>Sangiorgi, Davide</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of the ACM</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Pierce, Benjamin C</au><au>Sangiorgi, Davide</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Behavioral equivalence in the polymorphic pi-calculus</atitle><jtitle>Journal of the ACM</jtitle><date>2000-05-01</date><risdate>2000</risdate><volume>47</volume><issue>3</issue><spage>531</spage><epage>584</epage><pages>531-584</pages><issn>0004-5411</issn><eissn>1557-735X</eissn><coden>JACOAH</coden><abstract>We investigate parametric polymorphism in message-based concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambda-calculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly manipulating data values whose types are abstract, leading to notions of equivalence much coarser than the standard untyped ones. We study the nature of these constraints through simple examples of concurrent abstract data types and develop basic theoretical machinery for establishing bisimilarity of polymorphic processes. We also observe some surprising interactions between polymorphism and aliasing, drawing examples from both the polymorphic pi-calculus and ML.</abstract><cop>New York</cop><pub>Association for Computing Machinery</pub><doi>10.1145/337244.337261</doi><tpages>54</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0004-5411 |
| ispartof | Journal of the ACM, 2000-05, Vol.47 (3), p.531-584 |
| issn | 0004-5411 1557-735X |
| language | eng |
| recordid | cdi_proquest_miscellaneous_28888839 |
| source | ACM Digital Library |
| subjects | Calculus Equivalence Mathematical analysis Observers Polymorphism Programming Programming languages Studies Theory |
| title | Behavioral equivalence in the polymorphic pi-calculus |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T09%3A12%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Behavioral%20equivalence%20in%20the%20polymorphic%20pi-calculus&rft.jtitle=Journal%20of%20the%20ACM&rft.au=Pierce,%20Benjamin%20C&rft.date=2000-05-01&rft.volume=47&rft.issue=3&rft.spage=531&rft.epage=584&rft.pages=531-584&rft.issn=0004-5411&rft.eissn=1557-735X&rft.coden=JACOAH&rft_id=info:doi/10.1145/337244.337261&rft_dat=%3Cproquest_cross%3E1808125401%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=194223879&rft_id=info:pmid/&rfr_iscdi=true |