2444 search results - page 326 / 489 » Feature Construction for Back-Propagation |
194
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
The MLF type system by Le Botlan and R?emy (2003) is a natural extension of Hindley-Milner type inference that supports full firstclass polymorphism, where types can be of higher-...
159
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
nt programs require high-level abstractions in order to manage complexity and enable compositional reasoning. In this paper, we introduce a novel concurrency abstraction, dubbed t...
170
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
Generalized algebraic data types (GADTs), sometimes known as "guarded recursive data types" or "first-class phantom types", are a simple but powerful generaliz...
159
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...
192
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
Datatype-generic programming (DGP) is the next step beyond abstracting over types using parametric polymorphism, which is often called "genericity" in object-oriented la...