Sciweavers

1003 search results - page 21 / 201
» Type Inference with Inequalities
Sort
View
ECOOP
2004
Springer
14 years 2 months ago
Demand-Driven Type Inference with Subgoal Pruning: Trading Precision for Scalability
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...
S. Alexander Spoon, Olin Shivers
TR
2008
164views more  TR 2008»
13 years 8 months ago
Inference Based on Type-II Hybrid Censored Data From a Weibull Distribution
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...
Aveek Banerjee, Debasis Kundu
DASFAA
2010
IEEE
252views Database» more  DASFAA 2010»
14 years 1 months ago
Effectively Inferring the Search-for Node Type in XML Keyword Search
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...
Jiang Li, Junhu Wang
SAC
2009
ACM
14 years 3 months ago
Static type inference for Ruby
Many general-purpose, object-oriented scripting languages are dynamically typed, to keep the language flexible and not reject any programs unnecessarily. However, dynamic typing ...
Michael Furr, Jong-hoon (David) An, Jeffrey S. Fos...
LFP
1992
140views more  LFP 1992»
13 years 9 months ago
Global Tagging Optimization by Type Inference
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...
Fritz Henglein