Sciweavers

429 search results - page 1 / 86
» Parameter-free polymorphic types
Sort
View
APAL
2008
79views more  APAL 2008»
13 years 5 months ago
Parameter-free polymorphic types
Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal ...
Klaus Aehlig
PAKDD
2010
ACM
158views Data Mining» more  PAKDD 2010»
13 years 9 months ago
Integrative Parameter-Free Clustering of Data with Mixed Type Attributes
Abstract. Integrative mining of heterogeneous data is one of the major challenges for data mining in the next decade. We address the problem of integrative clustering of data with ...
Christian Böhm, Sebastian Goebl, Annahita Osw...
ICFP
1999
ACM
13 years 9 months ago
Type Inference with Rank 1 Polymorphism for Type-Directed Compilation of ML
This paper defines an extended polymorphic type system for an ML-style programming language, and develops a sound and complete type inference algorithm. Different from the conve...
Atsushi Ohori, Nobuaki Yoshida
APLAS
2010
ACM
13 years 5 months ago
A Certified Implementation of ML with Structural Polymorphism
Abstract. The type system of Objective Caml has many unique features, which make ensuring the correctness of its implementation difficult. One of these features is structurally pol...
Jacques Garrigue
POPL
1997
ACM
13 years 9 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones