We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as ...
Even when programming in a statically typed language we every now and then encounter statically untypable values; such values result from interpreting values or from communicating...
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
A novel framework called 2D Fisher Discriminant Analysis
(2D-FDA) is proposed to deal with the Small Sample
Size (SSS) problem in conventional One-Dimensional Linear
Discriminan...
Hui Kong, Lei Wang, Eam Khwang Teoh, Jian-Gang Wan...