POPL
1993
ACM
13 years 9 months ago
1993
ACM
POPL
1993
ACM
13 years 9 months ago
1993
ACM
We study the type inference problem for a system with type classes as in the functional programminglanguage Haskell. Type classes are an extension of ML-style polymorphismwith ove...
POPL
1993
ACM
13 years 9 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
POPL
1993
ACM
13 years 9 months ago
1993
ACM
POPL
1993
ACM
13 years 9 months ago
1993
ACM
Static scoping embodies a strong encapsulation mechanism for hiding the details of program units. Yet, it does not allow the sharing of variable bindings locations across indepe...
POPL
1993
ACM
13 years 9 months ago
1993
ACM
POPL
1993
ACM
13 years 9 months ago
1993
ACM
POPL
1993
ACM
13 years 9 months ago
1993
ACM
POPL
1993
ACM
13 years 9 months ago
1993
ACM
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 typ...