11017 search results - page 12 / 2204 » Closure Systems and their Structure |
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
Schema mappings are declarative specifications that describe the relationship between two database schemas. In recent years, there has been an extensive study of schema mappings a...
AGTIVE
2003
Springer
14 years 1 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
DBPL
1995
Springer
13 years 11 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of progr...
ENTCS
2006
13 years 7 months ago
2006
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...