A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We study languages for manipulating partially ordered structures with duplicates (e.g. trees, lists). As a general framework, we consider the pomset (partially ordered multiset) datatype. We introduce an algebra for pomsets, which generalizes traditional algebras for (nested) sets, bags and lists. This paper is motivated by the study of the impact of di erent language primitives on the expressive power. We show that the use of partially ordered types increases the expressive power signi cantly.doi:10.1007/3-540-58907-4_16 fatcat:dydnv63vmzh35oofg4lhu6z5pi