Informatik-Kolloquium am 7. The research has its direct applications in type inference, optimization and verification of imperative, functional, logic and reactive programs.
Set constraints are first-order logic formulas interpreted over the domain of sets of trees.
These sets of trees are possibly recursively defined. The first-order theory that they form is interesting on its own right. Thus, research on set constraints can be fundamental research. Research on set constraints can also be applied research. This is because set constraints form the algorithmic basis for a certain kind of program analysis that is called set-based.