1982 search results - page 49 / 397 » Parametricity and dependent types |
152
click to vote
CONCUR
1999
Springer
15 years 10 months ago
1999
Springer
This paper investigates an approach for statically preventing race conditions in an object-oriented language. The setting of this work is a variant of Gordon and Hankin’s concurr...
146
click to vote
SIAMDM
2008
15 years 6 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
159
click to vote
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
175
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
Datatype-generic programming involves parametrization by the shape of data, in the form of type constructors such as `list of'. Most approaches to datatype-generic programmin...
141
click to vote
TACS
1991
Springer
15 years 9 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...