88 search results - page 5 / 18 » Expressing Implicit Semantic Relations without Supervision |
XSYM
2010
Springer
13 years 8 months ago
2010
Springer
Keys for XML data trees can uniquely identify nodes based on the data values on some of their subnodes, either in the entire tree or relatively to some selected subtrees. Such keys...
VMCAI
2010
Springer
14 years 7 months ago
2010
Springer
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...
VLDB
1989
ACM
14 years 1 months ago
1989
ACM
An important direction in database research for non-standard applications (e.g. engineering or design applications) deals with adequate support for complex objects. Without doubt,...
POPL
2006
ACM
14 years 10 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
POPL
2006
ACM
14 years 10 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...