@Miaourt Spontanément je dirais que c’est une sorte d’inclusion ?

@Sylvhem d'après @epi c'est un truc comme ça https://en.wikipedia.org/wiki/Join_and_meet

@Miaourt I've never seen that relation before, but what that equation is telling you is that ⊥ is an identity element with respect to that relation

like, 0 is an identity with + because x + 0 = 0 + x = x

and 1 is an identity with × because x × 1 = 1 × x = x

@Miaourt sorry if you alread knew that

@Miaourt the V is a subscript on the operator symbol by the way

it looks like it's some kind of fancy disjoint union symbol: https://en.wikipedia.org/wiki/Disjoint_union

@cyberia consider that my math level is highschool tier, and not even good back then

@cyberia Oh, the ⊥ is defined earlier, so I understood it a bit better.

If you want the paper where all of this appear https://hal.inria.fr/hal-02303490/document

According to @epi that would be this https://en.wikipedia.org/wiki/Join_and_meet

@Miaourt @cyberia

Yeah, that's what they say, in Section 2:

> In this paper we use the formulation of CRDTs as a join-

semilattice on replica states, that is a CRDT is a set of possible

states V with a symmetric join operation \sqcup.

I guess they also require the bottom element _|_. Exercise for the reader:

If V is a CRDT (join-semilattice) and K is any set, then `K -> V` is a CRDT

Yeah, that's what they say, in Section 2:

> In this paper we use the formulation of CRDTs as a join-

semilattice on replica states, that is a CRDT is a set of possible

states V with a symmetric join operation \sqcup.

I guess they also require the bottom element _|_. Exercise for the reader:

If V is a CRDT (join-semilattice) and K is any set, then `K -> V` is a CRDT

Eugen's Pleroma Instance (#BLM)@epi@ihatebeinga.live