Sciweavers

228 search results - page 7 / 46
» An effective theory of type refinements
Sort
View
NDJFL
2000
79views more  NDJFL 2000»
13 years 6 months ago
An Information-Based Theory of Conditionals
We present an approach to combining three areas of research which we claim are all based on information theory: knowledge representation in Artificial Intelligence and Cognitive Sc...
Wayne Wobcke
SIGSOFT
2005
ACM
14 years 7 months ago
Lightweight object specification with typestates
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
Kevin Bierhoff, Jonathan Aldrich
PLDI
2005
ACM
14 years 17 days ago
Permission-based ownership: encapsulating state in higher-order typed languages
Today’s module systems do not effectively support information hiding in the presence of shared mutable objects, causing serious problems in the development and evolution of larg...
Neelakantan R. Krishnaswami, Jonathan Aldrich
LICS
2003
IEEE
14 years 8 days ago
Structural Subtyping of Non-Recursive Types is Decidable
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...
Viktor Kuncak, Martin C. Rinard
MM
2010
ACM
177views Multimedia» more  MM 2010»
13 years 7 months ago
Image tag refinement towards low-rank, content-tag prior and error sparsity
The vast user-provided image tags on the popular photo sharing websites may greatly facilitate image retrieval and management. However, these tags are often imprecise and/or incom...
Guangyu Zhu, Shuicheng Yan, Yi Ma