Newest at the top
| 2024-04-26 14:11:51 +0200 | <fedir> | Thanks! |
| 2024-04-26 14:11:29 +0200 | nij- | (~NPC@c-73-238-75-2.hsd1.ma.comcast.net) (Using Circe, the loveliest of all IRC clients) |
| 2024-04-26 14:11:24 +0200 | <geekosaur> | fedir, ghci doesn't know how to group the defining equations together by itself, as ncf says you must put them on one line or use :{ :} to group them |
| 2024-04-26 14:11:09 +0200 | <ncf> | or semicolons |
| 2024-04-26 14:10:53 +0200 | <ncf> | fedir: use :{ and :} to delimit multi-line definitions in ghci |
| 2024-04-26 14:10:28 +0200 | <ncf> | better than incorrect jargon! |
| 2024-04-26 14:10:26 +0200 | <fedir> | What's wrong?https://i.imgur.com/0LoCDJt.png |
| 2024-04-26 14:10:17 +0200 | xff0x | (~xff0x@2405:6580:b080:900:a359:eeea:f982:7525) |
| 2024-04-26 14:10:06 +0200 | <nij-> | (Yeah.. ncf, I just think 2-mors are too much a jargon for this channel.) |
| 2024-04-26 14:09:42 +0200 | <nij-> | structuralizing and forgetting pair |
| 2024-04-26 14:09:24 +0200 | <ncf> | up to 2-morphisms* |
| 2024-04-26 14:09:24 +0200 | <nij-> | ncf Oh right, those too! |
| 2024-04-26 14:08:54 +0200 | <nij-> | Anyway, it's a very natural generalization of inverse functors. |
| 2024-04-26 14:08:47 +0200 | <ncf> | but e.g. the free monoid functor [] can be seen as a left adjoint to the forgetful functor from the category of monoids to the category of sets (or hask) |
| 2024-04-26 14:08:33 +0200 | <nij-> | In math point of view, the functors F and G are adjoint (i.e. form an adjunction pair) if they are "invertible" to each other "up to 2-functors (i.e. functors between functors)" . |
| 2024-04-26 14:08:12 +0200 | mei | (~mei@user/mei) |
| 2024-04-26 14:07:39 +0200 | <jackdk> | the Representable superclass is good fun though |
| 2024-04-26 14:07:15 +0200 | <ncf> | yeah adjunctions between hask and hask are not immensely interesting |
| 2024-04-26 14:06:33 +0200 | <jackdk> | Near as I can tell from https://hackage.haskell.org/package/adjunctions-4.4.2/docs/Data-Functor-Adjunction.html , it's just (r,) and (r ->), and various lifting instances |
| 2024-04-26 14:06:05 +0200 | acidjnk | (~acidjnk@p200300d6e714dc76fc9e8da7e9a4142b.dip0.t-ipconnect.de) |
| 2024-04-26 14:06:02 +0200 | TheCoffeMaker | (~TheCoffeM@user/thecoffemaker) |
| 2024-04-26 14:05:53 +0200 | <nij-> | tomsmeding Yeah, I'm just curious xD |
| 2024-04-26 14:04:26 +0200 | tomsmeding | writes lots of haskell code, including interesting type trickery, without properly knowing what an adjunction is |
| 2024-04-26 14:04:07 +0200 | fedir | (~fedir@188.191.238.23) |
| 2024-04-26 14:03:27 +0200 | <nij-> | Hmm.. I'm just trying out my luck to see if we have more intereting adjunctions. And since ,-> adjunctions show up elsewhere, my curiousity doesn't stop here :D |
| 2024-04-26 14:02:25 +0200 | TheCoffeMaker | (~TheCoffeM@user/thecoffemaker) (Excess Flood) |
| 2024-04-26 14:01:59 +0200 | <ncf> | not sure what you mean by that |
| 2024-04-26 14:01:54 +0200 | TheCoffeMaker | (~TheCoffeM@user/thecoffemaker) |
| 2024-04-26 14:01:14 +0200 | mei | (~mei@user/mei) (Remote host closed the connection) |
| 2024-04-26 14:00:53 +0200 | TheCoffeMaker | (~TheCoffeM@user/thecoffemaker) (Excess Flood) |
| 2024-04-26 13:59:43 +0200 | Square | (~Square@user/square) |
| 2024-04-26 13:59:38 +0200 | <nij-> | Any other .. that's useful, and particularly only "works in CompSci"? |
| 2024-04-26 13:59:12 +0200 | <nij-> | hom tensor adjunction |
| 2024-04-26 13:58:57 +0200 | <nij-> | Delaying evaluation, or (un)currying |
| 2024-04-26 13:58:56 +0200 | <tomsmeding> | well, a x - and a -> - |
| 2024-04-26 13:58:47 +0200 | <nij-> | I see. In math this is just x and ->. |
| 2024-04-26 13:58:17 +0200 | <ncf> | (,) a b is (a, b) (pair type) and (->) a b is a -> b (function type) |
| 2024-04-26 13:57:33 +0200 | glguy | (g@libera/staff/glguy) (Read error: Connection reset by peer) |
| 2024-04-26 13:55:54 +0200 | <nij-> | What are them? They aren't composed with eng chars so too hard to find with google. |
| 2024-04-26 13:55:41 +0200 | <nij-> | I don't know about these two functors.. wow. |
| 2024-04-26 13:54:48 +0200 | bitdex | (~bitdex@gateway/tor-sasl/bitdex) (Quit: = "") |
| 2024-04-26 13:53:31 +0200 | <ncf> | relations between functors are bound to involve types and functions |
| 2024-04-26 13:53:13 +0200 | <ncf> | well, (,) a and (->) a are the functors here |
| 2024-04-26 13:52:35 +0200 | <nij-> | multiple (i.e. more than 1) functors |
| 2024-04-26 13:52:27 +0200 | <nij-> | hmm.. im not looking for functions that have algebraic relations, but functors. |
| 2024-04-26 13:51:18 +0200 | <ncf> | (and a Store comonad) |
| 2024-04-26 13:51:08 +0200 | <ncf> | you can make a State monad out of this! |
| 2024-04-26 13:50:18 +0200 | <lambdabot> | (((a1, b1) -> c1) -> a1 -> b1 -> c1, (a2 -> b2 -> c2) -> (a2, b2) -> c2) |
| 2024-04-26 13:50:17 +0200 | <ncf> | :t (curry, uncurry) |
| 2024-04-26 13:50:05 +0200 | <ncf> | (,) a ⊣ (->) a |
