In this paper, we propose to deploy type-theoretic techniques to the service description and composition verification. We define a flexible type system for modeling instances and mappings of semi-structured data, and demonstrate how it can be used to model a wide range of data services, ranging from relational database queries to web services for XML. Type-theoretic analysis and verification are then reduced to the problem of type unification. We present the (in)tractability result of the unification problem, and the expressiveness of our proposed type system.
Ken Q. Pu