Relaxing the Value Restriction

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.

• Type: Conference
• Year: 2004
• Where: FLOPS
• Authors: Jacques Garrigue
• Keywords: FLOPS 2004, Hardware, Imperative Features, ML-like Programming Languages, Undeniable Advantages