Most of my exposure to using categorical results to design algorithms, is through modularity in functional programming. I am wondering whether there are examples where the proof of existence of polynomial-time algorithms went through category theory, where the algorithmic question isn't some form of thinly veiled canonicity/normalization statement. Is there an algorithm where the correctness of the algorithm relies on categorical constructions, the algorithm itself is practical to execute and the problem statement isn't categorical in nature?



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.