parametric polymorphism


Also found in: Wikipedia.

parametric polymorphism

References in periodicals archive ?
Finally, we prove that queries with an order by clause can be statically type-checked in a type system that supports parametric polymorphism of the form available in the C++ binding of the ODMG standard.
interface Collection: Object { unsigned long cardinality(); boolean is_empty(); void insert_element(in any element); void remove_element(in any element); boolean contains_element(in any element); Iterator create_iterator(); }; The above interface is a good illustration of an awkward way of expressing parametric polymorphism in the ODMG object model.
any is used in the ODMG object model where a type parameter would appear in a type system that supports parametric polymorphism. However, the ODMG object model does not support parametric polymorphism.
The syntactic style in this paper for parametric object types follows the style of the ODMG object model and the proposed extensions of Java with parametric polymorphism [Odersky and Wadler 1997; Agesen et al.
}; As opposed to the Bag interface, as defined in the ODMG object model, a type system that supports parametric polymorphism (such as the C++ binding of the ODMG standard) also allows a clean definition of a parametric Bag interface derived by inheritance from the parametric Collection interface.
In a type system that supports parametric polymorphism (such as the type system of the C++ binding of the ODMG standard), one can be a lot more precise about the type of a class extent.
(OQL queries with parametric polymorphism).With proper usage of parametric polymorphism, the collections from Example 16 now have the following form:
However proposals for incorporating dynamic typing into languages with parametric polymorphism have serious shortcomings.
Additional Key Words and Phrases: Dynamic typing, marshalling, parametric polymorphism, static typing
Languages such as Ada [1979] and ML [1990] improve the flexibility of static typing by providing parametric polymorphism, that allows static type-checking of reusable software components which operate generically over data structures such as lists, sets, trees, etc.
An obvious issue in the design of dynamic typing mechanisms is how to incorporate it into languages with parametric polymorphism. Proposals for adding dynamic typing to languages such as ML (for the purpose of type-safe distributed communication with which we are primarily concerned) essentially consist of adding the dynamic construct, with minor extensions.
In this article we present a new approach to incorporating dynamic typing into statically typed languages, particularly languages with parametric polymorphism such as ML.

Full browser ?