Sciweavers

1810 search results - page 3 / 362
» Type Systems for Distributed Data Structures
Sort
View
ASPLOS
2006
ACM
14 years 1 months ago
Type inference for unboxed types and first class mutability
Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hardware specification, and temporal predictability. T...
Swaroop Sridhar, Jonathan S. Shapiro
BMCBI
2008
149views more  BMCBI 2008»
13 years 7 months ago
Evolution of biological sequences implies an extreme value distribution of type I for both global and local pairwise alignment s
Background: Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic d...
Olivier Bastien, Eric Maréchal
TIC
2000
Springer
174views System Software» more  TIC 2000»
13 years 11 months ago
Alias Types for Recursive Data Structures
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
David Walker, J. Gregory Morrisett
IJCSA
2007
89views more  IJCSA 2007»
13 years 7 months ago
Selection of Indexing Structures in Grid Data Warehouses with Software Agents
Data warehouse systems service larger and larger sets of data. Effective data indexing is not sufficient, because one system node is unable to store such amount ofquickly flowing ...
Marcin Gorawski, Michal Gorawski, Slawomir Bankows...
HASKELL
2006
ACM
14 years 1 months ago
Strongly typed memory areas programming systems-level data structures in a functional language
Modern functional languages offer several attractive features to support development of reliable and secure software. However, in our efforts to use Haskell for systems programmin...
Iavor S. Diatchki, Mark P. Jones