5158 search results - page 339 / 1032 » Generalization of the Dempster-Shafer Theory |
170
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
181
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
Many large software systems originate from untyped scripting language code. While good for initial development, the lack of static type annotations can impact code-quality and per...
176
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
167
click to vote
PPOPP
2010
ACM
16 years 4 months ago
2010
ACM
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
169
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...