Abstract

Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity theorem. However, Reynolds's theorem can be difficult to show in some settings, particularly ones involving computational effects. I present an alternative technique for proving some parametricity results. This technique is considerably simpler and easily generalizes to effectful settings. It works by instantiating polymorphic functions with singleton types that fully specify the behavior of the functions. Using this technique, I show that callers' stacks are protected from corruption during function calls in Typed Assembly Language programs. 1 Introduction A polymorphic function can be termed parametric [11] if it always uses the same algorithm, regardless of the type at which it is applied. In particular, a parametric, polymorphic function can neither branch on nor otherwise analyze its type argument. In many type ...

Citations

557	From system F to typed assembly language - Morrisett, Walker, et al. - 1999
490	A syntactic approach to type soundness - Wright, Felleisen - 1994
332	Types, abstraction and parametric polymorphism - Reynolds - 1983
292	Theorems for free - Wadler - 1989
146	Fundamental concepts in programming languages - Strachey - 2000
136	Stack-based typed assembly language - Morrisett, Crary, et al. - 2002
112	A logic for parametric polymorphism - Plotkin, Abadi - 1993
107	An extension of System F with subtyping - Cardelli, Martini, et al. - 1994
102	R.D.: Parametricity and local variables - O’Hearn, Tennent - 1995
53	Types, abstraction, and parametric polymorphism, part 2 - Ma, Reynolds - 1992
22	Relational parametricity and units of measure - Kennedy - 1997
11	Subtyping and parametricity - Plotkin, Abadi, et al. - 1994
7	Parametricity as subtyping - Ma - 1992