19 search results - page 4 / 4 » On strong normalization and type inference in the intersecti... |
TAPSOFT
1997
Springer
13 years 9 months ago
1997
Springer
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
FOSSACS
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...
POPL
1994
ACM
13 years 8 months ago
1994
ACM
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
CVPR
1996
IEEE
14 years 6 months ago
1996
IEEE
When computing descriptors of image data, the type of information that can be extracted may be strongly dependent on the scales at which the image operators are applied. This arti...