Parametric Polymorphism - Universally
نویسندگان
چکیده
In the 1980s, John Reynolds postulated that a parametrically polymorphic function is an ad-hoc polymorphic function satisfying a uniformity principle. This allowed him to prove that his set-theoretic semantics has a relational lifting which satisfies the Identity Extension Lemma and the Abstraction Theorem. However, his definition (and subsequent variants) have only been given for specific models. In contrast, we give a model-independent axiomatic treatment by characterising Reynolds’ definition via a universal property, and show that the above results follow from this universal property in the axiomatic setting.
منابع مشابه
Structural Polymorphism
This paper describes structural polymorphism, a new form of type polymorphism appropriate to functional languages featuring user-defined algebraic data types (e.g., Standard ML, Haskell and Miranda1). The approach extends the familiar notion of parametric polymorphism by allowing the definition of functions which are generic with respect to data structures as well as to individual types. For ex...
متن کاملFamily Resemblance vs. Polymorphism
CONTENTS SUMMARY "Measure boundary" concepts for domains with a metric Use of task-related boundary Metrical and non-metrical concepts, and polymorphism Parametric polymorphism in biological designs Family Resemblance Ryle’s Polymorphism Parametric polymorphism in computer science Exercises for the reader Evolution and parametric polymorphism Programming languages with parametric polymorphism M...
متن کاملType Checking Higher - Order Polymorphic Multi - MethodsFran
We present a new predicative and decidable type system , called ML , suitable for languages that integrate functional programming and parametric polymorphism in the tradition of ML 21, 28], and class-based object-oriented programming and higher-order multi-methods in the tradition of CLOS 12]. Instead of using ex-tensible records as a foundation for object-oriented extensions of functional lang...
متن کاملOuter enclosures to the parametric AE solution set
We consider systems of linear equations, where the elements of the matrix and of the right-hand side vector are linear functions of interval parameters. We study parametric AE solution sets, which are defined by universally and existentially quantified parameters, and the former precede the latter. Based on a recently obtained explicit description of such solution sets, we present three approac...
متن کاملLightweight Parametric Polymorphism for Oberon
Strongly typed polymorphism is necessary for expressing safe reusable code. Two orthogonal forms of polymorphism exist: inclusion and parametric, the Oberon language only supports the former. We describe a simple extension to Oberon to support parametric polymor-phism. The extension is in keeping with the Oberon language: it is simple and has an explicit cost. In the paper we motivate the need ...
متن کامل