1003 search results - page 21 / 201 » Type Inference with Inequalities |
113
Voted
ECOOP
2004
Springer
15 years 7 months ago
2004
Springer
After two decades of effort, type inference for dynamically typed languages scales to programs of a few tens of thousands of lines of code, but no further. For larger programs, th...
123
Voted
TR
2008
15 years 1 months ago
2008
A hybrid censoring scheme is a mixture of Type-I and Type-II censoring schemes. This article presents the statistical inferences on Weibull parameters when the data are Type-II hyb...
125
Voted
DASFAA
2010
IEEE
15 years 6 months ago
2010
IEEE
xml keyword search provides a simple and user-friendly way of retrieving data from xml databases, but the ambiguities of keywords make it difficult to effectively answer keyword qu...
129
Voted
SAC
2009
ACM
15 years 8 months ago
2009
ACM
Many general-purpose, object-oriented scripting languages are dynamically typed, to keep the language flexible and not reject any programs unnecessarily. However, dynamic typing ...
126
click to vote
LFP
1992
15 years 3 months ago
1992
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...