Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

There has long been speculation in the scientific literature on how to dynamically enforce parametricity such as that yielded by… Expand

Is this relevant?

2017

2017

The polymorphic blame calculus integrates static typing, including universal types, with dynamic typing. The primary challenge… Expand

Is this relevant?

2017

2017

Polymorphic type systems such as System F enjoy the parametricity property: polymorphic functions cannot inspect their type… Expand

Is this relevant?

2016

2016

Object capabilities are a technique for fine-grained privilege separation in programming languages and systems, with important… Expand

Is this relevant?

Highly Cited

2012

Highly Cited

2012

Reynolds' abstraction theorem (Reynolds, J. C. (1983) Types, abstraction and parametric polymorphism, Inf. Process.83(1), 513-523… Expand

Is this relevant?

2012

2012

Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a… Expand

Is this relevant?

Highly Cited

1997

Highly Cited

1997

Abstract Studies of the mathematical properties of impredicatively polymorphic types have for the most part focused on the… Expand

Is this relevant?

1994

1994

We study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed λ-calculus with… Expand

Is this relevant?

1993

1993

J. C. Reynolds suggested that Strachey's intuitive concept of “parametric” (i.e., uniform) polymorphism is closely linked to… Expand

Is this relevant?