Results 1 - 10 of 567

Formal Parametric Polymorphism

by Martin Abadi , Luca Cardelli, Pierre-Louis Curien - THEORETICAL COMPUTER SCIENCE , 1993
"... A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typically semantic. In this paper, we develop a syntactic approach to parametricity, and a formal system that embodies this ..."
Abstract - Cited by 135 (4 self) - Add to MetaCart
A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds's work, the study of parametricity is typically semantic. In this paper, we develop a syntactic approach to parametricity, and a formal system that embodies

Lightweight Parametric Polymorphism for Oberon

by Paul Roe, Clemens Szyperski , 1997
"... . 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 polymorphism. The extension is in keeping w ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
. 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 polymorphism. The extension is in keeping

Parametric Polymorphism and Operational Equivalence

by Andrew M. Pitts - MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE , 2000
"... Studies of the mathematical properties of impredicative polymorphic types have for the most part focused on the polymorphic lambda calculus of Girard–Reynolds, which is a calculus of total polymorphic functions. This paper considers polymorphic types from a functional programming perspective, where ..."
Abstract - Cited by 85 (2 self) - Add to MetaCart
operational behaviour to parametricity properties of types. Working with an extension of Plotkin's PCF with ∀-types, lazy lists and existential types, we show by example how the resulting logical relation can be used to prove properties of polymorphic types up to operational equivalence.

Typed Parametric Polymorphism for Aspects

by Radha Jagadeesan, Alan Jeffrey, James Riely , 2006
"... We study the incorporation of generic types in aspect languages. Since advice acts like method update, such a study has to accommodate the subtleties of the interaction of classes, polymorphism and aspects. Indeed, simple examples demonstrate that current aspect compiling techniques do not avoid run ..."
Abstract - Cited by 28 (0 self) - Add to MetaCart
runtime type errors. We explore type systems with polymorphism for two models of parametric polymorphism: the type erasure semantics of Generic Java, and the type carrying semantics of designs such as generic C#. Our main contribution is the design and exploration of a source-level type system for a

Parametric Polymorphism in OBJ-3

by Martin Plümicke , 1997
"... This paper describes the modular polymorphic functional programming language OBJ--P. OBJ--P is an extension of OBJ--3 as OBJ--P allows parametric polymorphism for first-order types in the sense of the Hindley--Milner type system. In this paper we give an overview of the language and present in two ..."
Abstract - Add to MetaCart
This paper describes the modular polymorphic functional programming language OBJ--P. OBJ--P is an extension of OBJ--3 as OBJ--P allows parametric polymorphism for first-order types in the sense of the Hindley--Milner type system. In this paper we give an overview of the language and present in two

Parametric Polymorphism -- Universally

by Neil Ghani, Fredrik Nordvall Forsberg, Federico Orsanigo , 2015
"... 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 ..."
Abstract - Add to MetaCart
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

Relationally-Parametric Polymorphic Contracts

by Arjun Guha
"... The analogy between types and contracts raises the question of how many features of static type systems can be expressed as dynamic contracts. An important feature missing in prior work on contracts is parametricity, as represented by the polymorphic types in languages like Standard ML. We present a ..."
Abstract - Cited by 8 (1 self) - Add to MetaCart
The analogy between types and contracts raises the question of how many features of static type systems can be expressed as dynamic contracts. An important feature missing in prior work on contracts is parametricity, as represented by the polymorphic types in languages like Standard ML. We present

Parametric polymorphism for XML

by Haruo Hosoya, Alain Frisch, Giuseppe Castagna
"... Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be useful in XML processing in particular for programs involving “parametric schemas,” i.e., schemas parameterized over other ..."
Abstract - Cited by 24 (3 self) - Add to MetaCart
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be useful in XML processing in particular for programs involving “parametric schemas,” i.e., schemas parameterized over

On the performance of parametric polymorphism in maple

by Laurentiu Dragan, Stephen M. Watt - In Proc. Maple Conference 2006 , 2006
"... With the introduction of support for generics in mainstream programming languages, we see an renewed interest in writing generic code. Maple offers the possibility to write generic code using module-producing functions. There is usually a performance cost associated with the use of generics, and thi ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
small degradation of performance when using generics modeled on abstract data types and high performance degradation when using an object-oriented approach. Keywords. generics, parametric polymorphism, performance, Maple. 1

Reflexive Graphs and Parametric Polymorphism

by G. Rosolini , 1993
"... this paper is to understand why that is a parametric categorical model. In [10] Ma and Reynolds propose a parametricity hypothesis for a functor between categorical models of polymorphism which essentially requires that there is an extension of (a certain form of) an identity relation functor which ..."
Abstract - Cited by 25 (1 self) - Add to MetaCart
this paper is to understand why that is a parametric categorical model. In [10] Ma and Reynolds propose a parametricity hypothesis for a functor between categorical models of polymorphism which essentially requires that there is an extension of (a certain form of) an identity relation functor which
Results 1 - 10 of 567