Titlebook: Database Programming Languages; 6th International Wo Sophie Cluet,Rick Hull Conference proceedings 1998 Springer-Verlag Berlin Heidelberg 1

conscribe

Constrained matching is type safe,hes to the covariance/contravariance problem. While the existing object-oriented type systems are based on subtyping, F-bounded polymorphism and matching, this language system is based entirely on inheritance, which is identified with matching. The type of matching used in this paper relies on the t

付出

CREEK

樹木中

A structure-based approach to querying semi-structured data,beled graphs. Data in this model is self-describing and dynamically typed, and captures both schema and data information. The labels are arbitrary atomic values, such as strings, integers, reals, etc., and the integrated data graph is stored in a unique data repository, as a relation of .. The relat