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.

2015

2015

Gradual typing is a discipline for integrating dynamic checking into a static type system. Since its introduction in functional… Expand

Is this relevant?

2007

2007

A congruency theorem is proven for an ordered pair of groups of homeomorphisms of a metric space satisfying an abstract dilation… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

Let S be some type system. A typing in S for a typable term M is the collection of all of the information other than M which… Expand

Is this relevant?

Highly Cited

1999

Highly Cited

1999

In this paper we present a general framework HM(X) for Hindley/Milner style type systems with constraints, analogous to the CLP(X… Expand

Is this relevant?

1994

1994

Abstract We show how the Hindley/Milner polymorphic type system can be extended to incorporate overloading and subtyping. Our… Expand

Is this relevant?

1993

1993

We study the strict type assignment system, a restriction of the intersection type discipline (6), and prove that it has t he… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

Abstract The intersection type discipline for the λ-calculus (ITD) is an extension of the classical functionality theory of Curry… Expand

Is this relevant?

Highly Cited

1984

Highly Cited

1984

We consider the extension of Curry's basic functionality theory presented by Barendregt et al. (to appear), and we define, for… Expand

Is this relevant?

Highly Cited

1982

Highly Cited

1982

Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for… Expand

Is this relevant?

Highly Cited

1969

Highly Cited

1969

One of the aims of combinatory logic is to study the most basic properties of functions and other concepts, with as few… Expand

Is this relevant?