AbstractThis paper investigates parametric polymorphism in the presence of control operators. Our approach is to specialise a general type theory combining polymorphism and computational effects, by extending it with additional constants expressing control. By defining relationally parametric models of this extended calculus, we capture the interaction between parametricity and control. As a worked example, we show that recent results of M. Hasegawa on type definability in the second-order (call-by-name) λμ-calculus arise as special cases of general results valid for arbitrary computational effects
Polymorphic type systems such as System F enjoy the parametricity property: polymorphic functions ca...
Reynolds ’ theory of parametric polymorphism captures the invariance of polymorphically typed progra...
Reynolds\u27 abstraction theorem has recently been extended to lambda-calculi with dependent types. ...
AbstractThis paper investigates parametric polymorphism in the presence of control operators. Our ap...
Udgivelsesdato: August 9, 2009According to Strachey, a polymorphic program is parametric if it appli...
Reynolds’ notion of relational parametricity has been extremely influential and well studied for pol...
This thesis revisits the well-known notion of parametric polymorphismin the light of modern developm...
Reynolds’ original theory of relational parametricity was intended to capture the idea that polymorp...
Reynolds' theory of relational parametricity captures the invariance of polymorphically typed progra...
Data Types, though, as Reynolds stresses, is not perfectly suited for higher type or higher order sy...
This thesis revisits the well-known notion of parametric polymorphism in the light of modern develop...
Abstract. We define and study parametric polymorphism for a type system with recursive, product, uni...
AbstractA polymorphic function is parametric if its behavior does not depend on the type at which it...
Parametric polymorphism in functional programming languages with explicit polymorphism is the proper...
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simp...
Polymorphic type systems such as System F enjoy the parametricity property: polymorphic functions ca...
Reynolds ’ theory of parametric polymorphism captures the invariance of polymorphically typed progra...
Reynolds\u27 abstraction theorem has recently been extended to lambda-calculi with dependent types. ...
AbstractThis paper investigates parametric polymorphism in the presence of control operators. Our ap...
Udgivelsesdato: August 9, 2009According to Strachey, a polymorphic program is parametric if it appli...
Reynolds’ notion of relational parametricity has been extremely influential and well studied for pol...
This thesis revisits the well-known notion of parametric polymorphismin the light of modern developm...
Reynolds’ original theory of relational parametricity was intended to capture the idea that polymorp...
Reynolds' theory of relational parametricity captures the invariance of polymorphically typed progra...
Data Types, though, as Reynolds stresses, is not perfectly suited for higher type or higher order sy...
This thesis revisits the well-known notion of parametric polymorphism in the light of modern develop...
Abstract. We define and study parametric polymorphism for a type system with recursive, product, uni...
AbstractA polymorphic function is parametric if its behavior does not depend on the type at which it...
Parametric polymorphism in functional programming languages with explicit polymorphism is the proper...
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simp...
Polymorphic type systems such as System F enjoy the parametricity property: polymorphic functions ca...
Reynolds ’ theory of parametric polymorphism captures the invariance of polymorphically typed progra...
Reynolds\u27 abstraction theorem has recently been extended to lambda-calculi with dependent types. ...