297 search results - page 1 / 60 » Type checking with open type functions |
ICFP
2008
ACM
15 years 9 months ago
2008
ACM
We report on an extension of Haskell with open type-level functions and equality constraints that unifies earlier work on GADTs, functional dependencies, and associated types. The...
SFP
2001
14 years 11 months ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
ICFP
2002
ACM
15 years 9 months ago
2002
ACM
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...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Open domain question answering (QA) systems have to bridge the potential vocabulary mismatch between a question and its candidate answers. One can view this as a recall problem and...
JAPLL
2007
14 years 9 months ago
2007
Many open domain question answering systems answer questions by first harvesting a large number of candidate answers, and then picking the most promising one from the list. One c...