37 search results - page 5 / 8 » Subtyping Constraints in Quasi-lattices |
SIGMOD
2008
ACM
13 years 7 months ago
2008
ACM
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
SIGSOFT
2000
ACM
13 years 12 months ago
2000
ACM
We describe an extension to the Java programming language that supports static conformance checking and dynamic debugging of object "protocols," i.e., sequencing constra...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
This paper presents the core type system and type inference algorithm of OCamlDuce, a merger between OCaml and XDuce. The challenge was to combine two type checkers of very differ...
AGENTCL
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we define the concept of conversation policies: declarative specifications that govern communications between software agents using an agent communication language. ...
ISKI
1992
13 years 11 months ago
1992
One of the objectives of ooDBMSs is to use type-speci c methods for manipulating objects, in order to maintain the consistency of the database. This is, however, little help for t...