Sciweavers

11017 search results - page 9 / 2204
» Closure Systems and their Structure
Sort
View
LISA
2004
13 years 9 months ago
Experience in Implementing an HTTP Service Closure
One ideal of configuration management is to specify only desired behavior in a high-level language, while an automatic configuration management system assures that behavior on an ...
Steven Schwartzberg, Alva L. Couch
POPL
2004
ACM
14 years 8 months ago
Polymorphic typed defunctionalization
Defunctionalization is a program transformation that aims to turn a higher-order functional program into a first-order one, that is, to eliminate the use of functions as first-cla...
François Pottier, Nadji Gauthier
CIDR
2003
125views Algorithms» more  CIDR 2003»
13 years 9 months ago
Crossing the Structure Chasm
It has frequently been observed that most of the world’s data lies outside database systems. The reason is that database systems focus on structured data, leaving the unstructur...
Alon Y. Halevy, Oren Etzioni, AnHai Doan, Zachary ...
VLDB
1989
ACM
88views Database» more  VLDB 1989»
13 years 11 months ago
Estimating the Size of Generalized Transitive Closures
We present a framework for the estimation of the size of binary recursively defined relations. We show how the framework can be used to provide estimating algo rithms for the size...
Richard J. Lipton, Jeffrey F. Naughton
TLDI
2005
ACM
135views Formal Methods» more  TLDI 2005»
14 years 1 months ago
Types for describing coordinated data structures
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
Michael F. Ringenburg, Dan Grossman