Imperative Polymorphism by Store-Based Types as Abstract Interpretations
Pages 3 - 8
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.
References
[1]
A. Abel and J. Chapman. Normalization by evaluation in the delay monad: A case study for coinduction via copatterns and sized types. In MSFP'14, volume 153 of EPTCS, pages 51--67, 2014.
[2]
A. J. Ahmed. Semantics of Types for Mutable State. PhD thesis, Princeton University, 2004.
[3]
C. Bach Poulsen and P. D. Mosses. Deriving pretty-big-step semantics from small-step semantics. In ESOP'14, volume 8410 of LNCS, pages 270--289. Springer, 2014.
[4]
A. Chargueraud. Pretty-big-step semantics. In ESOP'13, volume 7792 of LNCS, pages 41--60. Springer, 2013.
[5]
P. Cousot. Types as abstract interpretations. In POPL'97, pages 316--331. ACM, 1997.
[6]
P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In POPL'79, pages 269--282. ACM, 1979.
[7]
P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretations. In POPL'92, pages 83--94. ACM, 1992.
[8]
L. Damas and R. Milner. Principal type-schemes for functional programs. In R. A. DeMillo, editor, POPL'82, pages 207--212. ACM, 1982.
[9]
J. Garrigue. Relaxing the value restriction. In FLOPS'04, volume 2998 of LNCS, pages 196--213. Springer, 2004.
[10]
G. Kahn. Natural semantics. In STACS'87, volume 247 of LNCS, pages 22--39. Springer, 1987.
[11]
X. Leroy and H. Grall. Coinductive big-step operational semantics. Inf. Comput., 207:284--304, 2009.
[12]
X. Leroy and P. Weis. Polymorphic type inference and assignment. In POPL'91, pages 291--302. ACM, 1991.
[13]
B. Monsuez. Polymorphic typing by abstract interpretation. In FSTTCS'92, volume 652 of LNCS, pages 217--228. Springer, 1992.
[14]
B. Monsuez. System F and abstract interpretation. In SAS'95, volume 983 of LNCS, pages 279--295. Springer, 1995.
[15]
G. Morrisett. Typed assembly language. In B. C. Pierce, editor, Advanced Topics in Types and Programming Languages. The MIT Press, 2004.
[16]
K. Nakata and T. Uustalu. Trace-based coinductive operational semantics for while. In TPHOLs'09, volume 5674 of LNCS, pages 375--390. Springer, 2009.
[17]
B. C. Pierce. Types and programming languages. MIT Press, 2002.
[18]
J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In LICS'02, pages 55--74. IEEE, 2002.
[19]
F. Smith, D. Walker, and G. Morrisett. Alias types. In ESOP'00, volume 1782 of LNCS, pages 366--381. Springer, 2000.
[20]
J.-P. Talpin and P. Jouvelot. The type and effect discipline. Inf. Comput., 111(2):245--296, 1994.
[21]
M. Tofte. Type inference for polymorphic references. Inf. Comput., 89(1):1--34, Sept. 1990.
[22]
A. K. Wright. Typing references by effect inference. In ESOP'92, volume 582 of LNCS, pages 473--491. Springer, 1992.
[23]
A. K. Wright. Simple imperative polymorphism. Lisp Symb. Comput., 8(4):343--355, Dec. 1995.
Index Terms
- Imperative Polymorphism by Store-Based Types as Abstract Interpretations
Recommendations
Type inference, principal typings, and let-polymorphism for first-class mixin modules
Proceedings of the tenth ACM SIGPLAN international conference on Functional programmingA mixin module is a programming abstraction that simultaneously generalizes λ-abstractions, records, and mutually recursive definitions. Although various mixin module type systems have been developed, no one has investigated principal typings or ...
Type inference, principal typings, and let-polymorphism for first-class mixin modules
ICFP '05: Proceedings of the tenth ACM SIGPLAN international conference on Functional programmingA mixin module is a programming abstraction that simultaneously generalizes λ-abstractions, records, and mutually recursive definitions. Although various mixin module type systems have been developed, no one has investigated principal typings or ...
An Unboxed Operational Semantics for ML Polymorphism
We present an unboxed operational semantics for an ML-style polymorphic language. Different from the conventional formalisms, the proposed semantics accounts for actual representations of run-time objects of various types, and supports a refined notion of ...
Comments
Information & Contributors
Information
Published In
January 2015
152 pages
Copyright © 2015 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 13 January 2015
Check for updates
Author Tags
Qualifiers
- Short-paper
Funding Sources
Conference
POPL '15
Sponsor:
POPL '15: The 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
January 13 - 14, 2015
Mumbai, India
Acceptance Rates
PEPM '15 Paper Acceptance Rate 14 of 27 submissions, 52%;
Overall Acceptance Rate 66 of 120 submissions, 55%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 90Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 02 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in