Abstract
Restricting polymorphism to values is now the standard way to obtain soundness in ML-like programming languages with imperative features. While this solution has undeniable advantages over previous approaches, it forbids polymorphism in many cases where it would be sound. We use a subtyping based approach to recover part of this lost polymorphism, without changing the type algebra itself, and this has significant applications. © Springer-Verlag 2004.
Cite
CITATION STYLE
Garrigue, J. (2004). Relaxing the Value Restriction. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2998, 196–213. https://doi.org/10.1007/978-3-540-24754-8_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
