Can you please add the title of the paper, or update the link? It's broken, and without the name, the answer is basically void. Thank you.

@RaduGRIGore That looks very interesting, thanks. I'll be happy to upvote, if you make it into an answer.

@RaduGRIGore I'd be interested in languages that have some use or value on their own, rather than just being artificially constructed for the sake of an example. We can always take a particular logic and make it into a language using Curry-Howard isomorphism, but I'd like to know, if there are more interesting examples.

@DamianoMazza You're right that the distinction between languages and paradigms is a bit unclear in my question. For me both suffices, in a sense. I'm more interested in actual languages. But since I don't know any particular languages for quantum computing, and any such language would be bound to its principles and lack contraction/weakening, this is enough for me as an example.

The Cat Programming Language looks like an example of a function, stack-based language.

@josiah No, as far as I know, comonads are functors, not cofunctors.