This paper studies the notion of conflict for a variant of Delta-Oriented Programming (DOP) without features, separating out the notions of hard and soft conflict. Specifically, we define a language for this subset of DOP and give a precise, formal definitions of these notions. We then define a type system based on row-polymorphism that ensures that the computation of a well-typed product will always succeed and has an unambiguous result.