Sciweavers

535 search results - page 10 / 107
» Do we need dependent types
Sort
View
LICS
2002
IEEE
14 years 14 days ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
JFP
2010
82views more  JFP 2010»
13 years 6 months ago
Formal polytypic programs and proofs
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
Wendy Verbruggen, Edsko de Vries, Arthur Hughes
FODO
1993
Springer
119views Algorithms» more  FODO 1993»
13 years 11 months ago
Physical Storage Organizations for Time-Dependent Multimedia Data
Abstract–Multimedia computing requires support for heterogeneous data types with differing storage, communication and delivery requirements. Continuous media data types such as ...
Huang-Jen Chen, Thomas D. C. Little
PLDI
2010
ACM
14 years 19 days ago
Traceable data types for self-adjusting computation
Self-adjusting computation provides an evaluation model where computations can respond automatically to modifications to their data by using a mechanism for propagating modifica...
Umut A. Acar, Guy E. Blelloch, Ruy Ley-Wild, Kanat...
KDD
2008
ACM
156views Data Mining» more  KDD 2008»
14 years 8 months ago
Unsupervised deduplication using cross-field dependencies
Recent work in deduplication has shown that collective deduplication of different attribute types can improve performance. But although these techniques cluster the attributes col...
Robert Hall, Charles A. Sutton, Andrew McCallum