Big O complexity for abstractions?

I recently had a discussion about the per-abstraction complexity of interactions that must be considered before changing a system.

I claimed that the worst case OOP interactions are O(n!) where n is the number of instances in the running system.

I also claimed that worst case monadic interactions are O(n!) where n is the number of monads stacked inside the monad transformer being altered.

Those are my first thoughts on abstraction complexity, based on my experience. Are there any research papers or books on abstraction complexity?

What are your estimations of abstraction complexity, and why?

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.


I think you meant O(n) for monadic interactions, at least that's what's in the chat log.

Prettier Link