Groupoid

[sadasant]

Algebra also has the definition of Groupoid: https://en.wikipedia.org/wiki/Groupoid_algebra

I'm definitely new to the algebraic world, but isn't it like... reducing a field K with a set of reducers G? It's not specific on the dimensions of the field or the number of applicable functions, which sounds definitely useful to me.

I wonder how it could be implemented. If there's interest on it, I would gladly help.

[sadasant]

I particularly like how the Groupoids are related to Automatas:

[puffnfresh]

What is this issue for? Getting Groupoid specified?

[sadasant]

Yes! Only if it makes sense.

[puffnfresh]

Starting with a Semigroupoid would be best. What would it look like in JS?

[sadasant]

I know this is not haskell, but I couldn't figure anything else closer to our realm...

Here's a package for one in haskell: https://hackage.haskell.org/package/semigroupoids

Here's a definition for Groupoid there: https://hackage.haskell.org/package/semigroupoids-5.1/docs/Data-Groupoid.html

And here's one for semigroupoid: https://hackage.haskell.org/package/semigroupoids-5.1/docs/Data-Semigroupoid.html

They say that a semigroupoid is a Category sans id.

Should we start with Category?
Feedback on the approach is appreciated \o/

[gabejohnson]

Category and Groupoid would both extend Semigroupoid. It would be useful for #208.

[sadasant]

@gabejohnson definitely!