We all know a lot about integer combinatoric compositions. Has any work been done on fractional, non-integer combinatoric compositions?

An integer has a finite set of compositions or partitions. If we were to consider fractions and non-integers the number of combinatoric compositions would be infinite. Has any work been done in this area?