No Cover Image

Conference Paper/Proceeding/Abstract 1137 views

Imperative Polymorphism by Store-Based Types as Abstract Interpretations

Casper Poulsen, Peter Mosses Orcid Logo, Paolo Torrini

PEPM '15: Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation, Pages: 3 - 8

Swansea University Authors: Casper Poulsen, Peter Mosses Orcid Logo, Paolo Torrini

Full text not available from this repository: check for access using links below.

DOI (Published version): 10.1145/2678015.2682545

Abstract

Dealing with polymorphism in the presence of imperative features is a long-standing open problem for Hindley-Milner type systems. A widely adopted approach is the value restriction, which inhibits polymorphic generalisation and unfairly rejects various programs that cannot go wrong. We consider abst...

Full description

Published in: PEPM '15: Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation
ISBN: 9781450332972
Published: New York, NY, United States Association for Computing Machinery (ACM) 2015
URI: https://cronfa.swan.ac.uk/Record/cronfa48796
first_indexed 2019-02-11T20:04:25Z
last_indexed 2025-07-13T02:09:44Z
id cronfa48796
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2025-07-11T12:44:45.5414537</datestamp><bib-version>v2</bib-version><id>48796</id><entry>2019-02-11</entry><title>Imperative Polymorphism by Store-Based Types as Abstract Interpretations</title><swanseaauthors><author><sid>91541f9477223b0ce3112ee98db37a3a</sid><firstname>Casper</firstname><surname>Poulsen</surname><name>Casper Poulsen</name><active>true</active><ethesisStudent>false</ethesisStudent></author><author><sid>3f13b8ec315845c81d371f41e772399c</sid><ORCID>0000-0002-5826-7520</ORCID><firstname>Peter</firstname><surname>Mosses</surname><name>Peter Mosses</name><active>true</active><ethesisStudent>false</ethesisStudent></author><author><sid>20a0808f39b564d8d2a3c57ab63e3ead</sid><ORCID/><firstname>Paolo</firstname><surname>Torrini</surname><name>Paolo Torrini</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2019-02-11</date><deptcode>MACS</deptcode><abstract>Dealing with polymorphism in the presence of imperative features is a long-standing open problem for Hindley-Milner type systems. A widely adopted approach is the value restriction, which inhibits polymorphic generalisation and unfairly rejects various programs that cannot go wrong. We consider abstract interpretation as a tool for constructing safe and precise type systems, and investigate how to derive store-based types by abstract interpretation. We propose store-based types as a type discipline that holds potential for interesting and flexible alternatives to the value restriction.</abstract><type>Conference Paper/Proceeding/Abstract</type><journal>PEPM '15: Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation</journal><volume/><journalNumber/><paginationStart>3</paginationStart><paginationEnd>8</paginationEnd><publisher>Association for Computing Machinery (ACM)</publisher><placeOfPublication>New York, NY, United States</placeOfPublication><isbnPrint>9781450332972</isbnPrint><isbnElectronic/><issnPrint/><issnElectronic/><keywords>type systems; operational semantics; references; polymorphism; abstract interpretation; store-based typing</keywords><publishedDay>13</publishedDay><publishedMonth>1</publishedMonth><publishedYear>2015</publishedYear><publishedDate>2015-01-13</publishedDate><doi>10.1145/2678015.2682545</doi><url/><notes/><college>COLLEGE NANME</college><department>Mathematics and Computer Science School</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>MACS</DepartmentCode><institution>Swansea University</institution><apcterm>Not Required</apcterm><funders>This work was supported by an EPSRC grant (EP/I032495/1) to Swansea University in connection with the PLanCompS project (www.plancomps.org).</funders><projectreference/><lastEdited>2025-07-11T12:44:45.5414537</lastEdited><Created>2019-02-11T15:45:38.9571916</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Casper</firstname><surname>Poulsen</surname><order>1</order></author><author><firstname>Peter</firstname><surname>Mosses</surname><orcid>0000-0002-5826-7520</orcid><order>2</order></author><author><firstname>Paolo</firstname><surname>Torrini</surname><orcid/><order>3</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2025-07-11T12:44:45.5414537 v2 48796 2019-02-11 Imperative Polymorphism by Store-Based Types as Abstract Interpretations 91541f9477223b0ce3112ee98db37a3a Casper Poulsen Casper Poulsen true false 3f13b8ec315845c81d371f41e772399c 0000-0002-5826-7520 Peter Mosses Peter Mosses true false 20a0808f39b564d8d2a3c57ab63e3ead Paolo Torrini Paolo Torrini true false 2019-02-11 MACS Dealing with polymorphism in the presence of imperative features is a long-standing open problem for Hindley-Milner type systems. A widely adopted approach is the value restriction, which inhibits polymorphic generalisation and unfairly rejects various programs that cannot go wrong. We consider abstract interpretation as a tool for constructing safe and precise type systems, and investigate how to derive store-based types by abstract interpretation. We propose store-based types as a type discipline that holds potential for interesting and flexible alternatives to the value restriction. Conference Paper/Proceeding/Abstract PEPM '15: Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation 3 8 Association for Computing Machinery (ACM) New York, NY, United States 9781450332972 type systems; operational semantics; references; polymorphism; abstract interpretation; store-based typing 13 1 2015 2015-01-13 10.1145/2678015.2682545 COLLEGE NANME Mathematics and Computer Science School COLLEGE CODE MACS Swansea University Not Required This work was supported by an EPSRC grant (EP/I032495/1) to Swansea University in connection with the PLanCompS project (www.plancomps.org). 2025-07-11T12:44:45.5414537 2019-02-11T15:45:38.9571916 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Casper Poulsen 1 Peter Mosses 0000-0002-5826-7520 2 Paolo Torrini 3
title Imperative Polymorphism by Store-Based Types as Abstract Interpretations
spellingShingle Imperative Polymorphism by Store-Based Types as Abstract Interpretations
Casper Poulsen
Peter Mosses
Paolo Torrini
title_short Imperative Polymorphism by Store-Based Types as Abstract Interpretations
title_full Imperative Polymorphism by Store-Based Types as Abstract Interpretations
title_fullStr Imperative Polymorphism by Store-Based Types as Abstract Interpretations
title_full_unstemmed Imperative Polymorphism by Store-Based Types as Abstract Interpretations
title_sort Imperative Polymorphism by Store-Based Types as Abstract Interpretations
author_id_str_mv 91541f9477223b0ce3112ee98db37a3a
3f13b8ec315845c81d371f41e772399c
20a0808f39b564d8d2a3c57ab63e3ead
author_id_fullname_str_mv 91541f9477223b0ce3112ee98db37a3a_***_Casper Poulsen
3f13b8ec315845c81d371f41e772399c_***_Peter Mosses
20a0808f39b564d8d2a3c57ab63e3ead_***_Paolo Torrini
author Casper Poulsen
Peter Mosses
Paolo Torrini
author2 Casper Poulsen
Peter Mosses
Paolo Torrini
format Conference Paper/Proceeding/Abstract
container_title PEPM '15: Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation
container_start_page 3
publishDate 2015
institution Swansea University
isbn 9781450332972
doi_str_mv 10.1145/2678015.2682545
publisher Association for Computing Machinery (ACM)
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 0
active_str 0
description Dealing with polymorphism in the presence of imperative features is a long-standing open problem for Hindley-Milner type systems. A widely adopted approach is the value restriction, which inhibits polymorphic generalisation and unfairly rejects various programs that cannot go wrong. We consider abstract interpretation as a tool for constructing safe and precise type systems, and investigate how to derive store-based types by abstract interpretation. We propose store-based types as a type discipline that holds potential for interesting and flexible alternatives to the value restriction.
published_date 2015-01-13T04:35:44Z
_version_ 1857889338048643072
score 11.097017

Similar Items