Sciweavers

169 search results - page 25 / 34
» A type system for well-founded recursion
Sort
View
ICFP
2006
ACM
14 years 7 months ago
From structures and functors to modules and units
t programming techniques encourage abstraction and reuse through external linking. Some parts of a program, however, must use concrete, internally specified references, so a pure ...
Scott Owens, Matthew Flatt
BMCBI
2005
131views more  BMCBI 2005»
13 years 7 months ago
Regularized Least Squares Cancer Classifiers from DNA microarray data
Background: The advent of the technology of DNA microarrays constitutes an epochal change in the classification and discovery of different types of cancer because the information ...
Nicola Ancona, Rosalia Maglietta, Annarita D'Addab...
SODA
2012
ACM
212views Algorithms» more  SODA 2012»
11 years 10 months ago
Parallelism and time in hierarchical self-assembly
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
Ho-Lin Chen, David Doty
PODS
1994
ACM
91views Database» more  PODS 1994»
13 years 11 months ago
A Polymorphic Calculus for Views and Object Sharing
We present a typed polymorphic calculus that supports a general mechanism for view definition and object sharing among classes. In this calculus, a class can contain inclusion spe...
Atsushi Ohori, Keishi Tajima
ICFP
2008
ACM
14 years 7 months ago
AURA: a programming language for authorization and audit
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
Limin Jia, Jeffrey A. Vaughan, Karl Mazurak, Jianz...