Diagonalization/ dupe for monads and tuples?

[chessai]

My understanding was that the root was intended to mean 'duplicate', not
the number two, so if we did have those, I would expect them to be named
dup, dup3, dup4, etc.

On Thu, Sep 17, 2020, 12:03 David Feuer <david.feuer at gmail.com> wrote:

> Does dup come with trip, quadrup, etc.? It doesn't have to, but once you
> plug one hole the others nearby start to stand out.
>
> On Wed, Sep 16, 2020, 1:58 PM Carter Schonwald <carter.schonwald at gmail.com>
> wrote:
>
>> It was pointed out to me in a private communication that the tuple
>> function \x->(x,x) is actually a special case of a diagonalization for
>> biapplicative and some related structures monadicially.  Another example in
>> the same flavor is pure impl for the applicative instance for sized lists.
>>
>> diag x = bipure x x
>>
>> So framed a litttle differently, there’s definitely an abstraction or
>> common pattern lurking here. Perhaps folks can help Tease this out. One
>> person I chatted with this morning alluded to it being relevant to
>> computational flavors of adjunctions or some such ? It def matters in a
>> different way when doing computation resource aware programming in a
>> symmetric monoidal category.
>>
>> Let’s collect some ideas and patterns and get to the bottom of this!
>> _______________________________________________
>> Libraries mailing list
>> Libraries at haskell.org
>> http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries
>>
> _______________________________________________
> Libraries mailing list
> Libraries at haskell.org
> http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/libraries/attachments/20200917/2c27fe9d/attachment.html>