Sciweavers

1810 search results - page 28 / 362
» Type Systems for Distributed Data Structures
Sort
View
ICFP
1999
ACM
14 years 1 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil
POPL
1998
ACM
14 years 1 months ago
From System F to Typed Assembly Language
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
J. Gregory Morrisett, David Walker, Karl Crary, Ne...
BMCBI
2007
144views more  BMCBI 2007»
13 years 8 months ago
Application of amino acid occurrence for discriminating different folding types of globular proteins
Background: Predicting the three-dimensional structure of a protein from its amino acid sequence is a long-standing goal in computational/molecular biology. The discrimination of ...
Y.-h. Taguchi, M. Michael Gromiha
NJC
2000
169views more  NJC 2000»
13 years 8 months ago
A Type System for Bounded Space and Functional In-Place Update
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
Martin Hofmann
SPAA
1990
ACM
14 years 24 days ago
Wait-Free Data Structures in the Asynchronous PRAM Model
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
James Aspnes, Maurice Herlihy