POPL
1991
ACM
15 years 28 days ago
1991
ACM
We present a new approach to the polymorphic typing of data accepting in-place modification in ML-like languages. This approach is based on restrictions over type generalization,...
74
Voted
LICS
1999
IEEE
15 years 1 months ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...