In this paper we describe an approach to build XML schemas in a collaborative way. The approach is based on computing intersection between sequences of type terms built over constants, function symbols and type symbols. For type symbols there may be the corresponding type rules that specify the (regular) set of term sequences the type symbol generates. We describe the intersection algorithm, prove its termination and correctness, illustrate it on examples and show how it can be used in collaborative schema development.