173 search results - page 11 / 35 » Incremental algorithms for dispatching in dynamically typed ... |
SFP
2000
13 years 9 months ago
2000
: We describe an algorithm approximatingthe following question: Given two types t1 and t2, are there instances (t1) and (t2) denoting a common element? By answering this question w...
VLDB
1998
ACM
14 years 2 days ago
1998
ACM
Semistructured data is not strictly typed like relational or object-oriented data and may be irregular or incomplete. It often arises in practice, e.g., when heterogeneous data so...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We outline an incremental learning algorithm designed for nonstationary environments where the underlying data distribution changes over time. With each dataset drawn from a new e...