![]() ![]() ![]() |
![]() |
|
|
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Return to Advanced XML technologies and applications We discuss the design of a quasi-statically typed language for XML in which data may be associated with different structures and different algebras in different scopes, whilst preserving identity. In declarative scopes, data are trees and may be queried with the full flexibility associated with XML query algebras. In procedural scopes, data have more conventional structures, such as records and sets, and can be manipulated with the constructs normally found in mainstream languages.For its original form of structural polymorphism, the language offers integrated support for the development of hybrid applications over XML, where data change form to reflect programming expectations and enable their enforcement. ![]() DiSC'03 © 2003 Association for Computing Machinery |