Logs: freenode/#haskell
| 2021-05-07 12:03:18 | → | royal_screwup213 joins (52254809@gateway/web/cgi-irc/kiwiirc.com/ip.82.37.72.9) |
| 2021-05-07 12:03:36 | <indomitable> | lortabac, well, if you want to apply those functions in languages that don't natively support them, then you kind of have to |
| 2021-05-07 12:03:42 | <indomitable> | ie, c#, which is my poison of choice |
| 2021-05-07 12:03:51 | <joel135> | best video i have seen on monads for programming https://www.youtube.com/watch?v=srQt1NAHYC0 |
| 2021-05-07 12:05:04 | <lortabac> | indomitable: oh I thought the question was about Haskell |
| 2021-05-07 12:05:33 | <indomitable> | lortabac, haskell is a very functional language, so it's a good place to ask question about functional things. also, one of the few channels i'm not banned from (yet) |
| 2021-05-07 12:05:36 | <__monty__> | I prefer Brian Beckman's crack at it, https://youtu.be/ZhuHCtR3xq8 |
| 2021-05-07 12:05:43 | <joel135> | other than that, it is true that a monad is a monoid, and it is true that every monad comes from a (not endo-) adjunction in two canonical ways |
| 2021-05-07 12:06:03 | <indomitable> | joel135, lol. i believe it, i just space out when i read it :-) |
| 2021-05-07 12:06:40 | <joel135> | i am not good at using monads for programming though |
| 2021-05-07 12:06:42 | <indomitable> | in some ways it's good to go "wat?" at things, because that's how non-developers feel when i try to explain coding stuff to them |
| 2021-05-07 12:06:46 | × | dhil quits (~dhil@195.213.192.4) (Ping timeout: 240 seconds) |
| 2021-05-07 12:07:07 | <indomitable> | joel135, you might enjoy the F# video about railway oriented programming then (it might be applicable to haskell too, but i don't know - haskell is a lot purer than f# in the functional sense) |
| 2021-05-07 12:07:56 | × | royal_screwup213 quits (52254809@gateway/web/cgi-irc/kiwiirc.com/ip.82.37.72.9) (Ping timeout: 246 seconds) |
| 2021-05-07 12:07:57 | <joel135> | i think i linked to the railway video? |
| 2021-05-07 12:08:05 | <lortabac> | indomitable: if your question is about monads as a concept in category theory, well... I guess you have to learn category theory |
| 2021-05-07 12:09:46 | <joel135> | the notion of adjunction is more symmetric than the notion of monoid. it comes with some nice geometry and logic too. i like adjunctions... |
| 2021-05-07 12:10:04 | → | Pickchea joins (~private@unaffiliated/pickchea) |
| 2021-05-07 12:10:16 | → | heatsink joins (~heatsink@108-201-191-115.lightspeed.sntcca.sbcglobal.net) |
| 2021-05-07 12:10:24 | <indomitable> | lortabac, you're a category-theory infiltrator, aren't you, trying to spread the gospel to the unwashed masses! |
| 2021-05-07 12:10:39 | <lortabac> | haha no, I know zero category theory |
| 2021-05-07 12:10:47 | <indomitable> | that's just what a phd in category theory would say |
| 2021-05-07 12:10:48 | <indomitable> | !!! |
| 2021-05-07 12:12:11 | → | shurick joins (~shurick@2a00:f480:6::9) |
| 2021-05-07 12:12:30 | <indomitable> | joel135, i'm checking out your video, thanks, might be a good place to start. i'll check out that computerphile video someone recommended also. |
| 2021-05-07 12:13:04 | <indomitable> | i'm gonna go before i get myself banned for one reason or another. |
| 2021-05-07 12:13:08 | ← | indomitable parts (~indomitab@gateway/tor-sasl/indomitable) ("Leaving") |
| 2021-05-07 12:14:40 | → | acidjnk_new2 joins (~acidjnk@p200300d0c72b9546b8782f113d81ff07.dip0.t-ipconnect.de) |
| 2021-05-07 12:14:46 | × | heatsink quits (~heatsink@108-201-191-115.lightspeed.sntcca.sbcglobal.net) (Ping timeout: 260 seconds) |
| 2021-05-07 12:16:46 | × | Guest276 quits (~textual@2603-7000-3040-0000-51c8-115a-6a5b-a292.res6.spectrum.com) (Quit: My MacBook has gone to sleep. ZZZzzz…) |
| 2021-05-07 12:16:59 | ← | shurick parts (~shurick@2a00:f480:6::9) () |
| 2021-05-07 12:17:12 | → | drbean_ joins (~drbean@TC210-63-209-98.static.apol.com.tw) |
| 2021-05-07 12:17:25 | × | star_cloud quits (~star_clou@ec2-34-220-44-120.us-west-2.compute.amazonaws.com) (Ping timeout: 265 seconds) |
| 2021-05-07 12:20:10 | → | dhil joins (~dhil@80.208.56.181) |
| 2021-05-07 12:20:54 | × | stree quits (~stree@68.36.8.116) (Ping timeout: 246 seconds) |
| 2021-05-07 12:21:16 | → | peterx112 joins (8ba26143@139.162.97.67) |
| 2021-05-07 12:24:29 | → | CrazyPython joins (~crazypyth@98.122.164.118) |
| 2021-05-07 12:25:59 | × | jonathanx_ quits (~jonathan@h-176-109.A357.priv.bahnhof.se) (Remote host closed the connection) |
| 2021-05-07 12:27:12 | → | frozenErebus joins (~frozenEre@37.231.244.249) |
| 2021-05-07 12:27:59 | → | jonathanx joins (~jonathan@h-176-109.A357.priv.bahnhof.se) |
| 2021-05-07 12:29:26 | → | nineonine joins (~nineonine@2604:3d08:7783:f200:a9b8:e92a:88db:4a1) |
| 2021-05-07 12:29:53 | <Gurkenglas> | Can you recommend software for inspecting types like 2 = {0,1}, 2²={(0,0),(0,1),(1,0),(1,1)}, 2->2 = {(0,0),(0,1),(1,1)}, 2²->2 and (2²->2)->2? I'd like to see graphs. |
| 2021-05-07 12:30:40 | → | nicholasbulka joins (~nicholasb@2601:900:4301:da0:9024:a632:8b7c:f290) |
| 2021-05-07 12:32:53 | → | carlomagno joins (~cararell@148.87.23.11) |
| 2021-05-07 12:33:17 | → | EvilMagix joins (~aVikingTr@2001:8003:340d:d00:b2de:b98:7a93:b0ea) |
| 2021-05-07 12:33:49 | → | royal_screwup213 joins (52254809@gateway/web/cgi-irc/kiwiirc.com/ip.82.37.72.9) |
| 2021-05-07 12:34:01 | × | nineonine quits (~nineonine@2604:3d08:7783:f200:a9b8:e92a:88db:4a1) (Ping timeout: 250 seconds) |
| 2021-05-07 12:34:11 | × | gnumonic quits (~gnumonic@c-73-170-91-210.hsd1.ca.comcast.net) (Ping timeout: 246 seconds) |
| 2021-05-07 12:34:28 | → | stree joins (~stree@68.36.8.116) |
| 2021-05-07 12:35:04 | × | royal_screwup213 quits (52254809@gateway/web/cgi-irc/kiwiirc.com/ip.82.37.72.9) (Client Quit) |
| 2021-05-07 12:35:22 | → | royal_screwup213 joins (52254809@gateway/web/cgi-irc/kiwiirc.com/ip.82.37.72.9) |
| 2021-05-07 12:36:25 | → | perrier-jouet joins (~perrier-j@modemcable012.251-130-66.mc.videotron.ca) |
| 2021-05-07 12:43:11 | × | marinelli quits (~marinelli@gateway/tor-sasl/marinelli) (Quit: marinelli) |
| 2021-05-07 12:44:23 | → | geekosaur joins (930099da@rrcs-147-0-153-218.central.biz.rr.com) |
| 2021-05-07 12:47:42 | × | perrier-jouet quits (~perrier-j@modemcable012.251-130-66.mc.videotron.ca) (Quit: WeeChat 3.1) |
| 2021-05-07 12:54:04 | <boxscape> | shouldn't 2^2 and 2->2 be the same type? |
| 2021-05-07 12:54:10 | <nut> | what is Pattern in TH? is it the same as pattern matching, that pattern? |
| 2021-05-07 12:55:38 | <Taneb> | boxscape: they should be isomorphic but not necessarily implemented in the same way |
| 2021-05-07 12:55:53 | → | marinelli joins (~marinelli@gateway/tor-sasl/marinelli) |
| 2021-05-07 12:56:08 | <boxscape> | right, Gurkenglas wrote {(0,0),(0,1),(1,0),(1,1)} and {(0,0),(0,1),(1,1)}, which does not look isomorphic |
| 2021-05-07 12:56:35 | <Taneb> | Oh, I see |
| 2021-05-07 12:56:53 | <Taneb> | Ah, I get it, that second one is kind of 2 <= 2 |
| 2021-05-07 12:57:14 | <Taneb> | It's the set of monotonic maps |
| 2021-05-07 12:57:20 | <Taneb> | No, monotonic pairs |
| 2021-05-07 12:57:24 | <Taneb> | Something like that |
| 2021-05-07 12:57:31 | <boxscape> | hmm |
| 2021-05-07 12:57:48 | <Gurkenglas> | Yea it's supposed to be monotonic maps from 2 to 3. |
| 2021-05-07 12:57:50 | <Gurkenglas> | *2 to 2 |
| 2021-05-07 12:57:55 | <boxscape> | I see |
| 2021-05-07 12:59:08 | <Gurkenglas> | every -> is supposed to be the monotonic functions (so every type is supposed to define some partial order) |
| 2021-05-07 12:59:41 | <Gurkenglas> | I suppose posing my questions like this, the obvious software is "write some code to define what you mean, then use graph libraries to define and draw some graphs" |
| 2021-05-07 13:01:37 | <Gurkenglas> | Is there something that is to Haskell as Google Colab is to Python? |
| 2021-05-07 13:01:41 | × | nicholasbulka quits (~nicholasb@2601:900:4301:da0:9024:a632:8b7c:f290) (Remote host closed the connection) |
| 2021-05-07 13:01:51 | × | hiroaki quits (~hiroaki@2a02:8108:8c40:2bb8:5226:d695:8fe3:b090) (Ping timeout: 260 seconds) |
| 2021-05-07 13:01:57 | → | nicholasbulka joins (~nicholasb@2601:900:4301:da0:9024:a632:8b7c:f290) |
| 2021-05-07 13:04:01 | → | hyperisco joins (~hyperisco@d192-186-117-226.static.comm.cgocable.net) |
| 2021-05-07 13:07:15 | → | SoF joins (~SoF@unaffiliated/skillyonfire) |
| 2021-05-07 13:08:00 | → | fkjc joins (52d3c378@52d3c378.dynamic-ip.k-net.dk) |
| 2021-05-07 13:08:36 | × | frozenErebus quits (~frozenEre@37.231.244.249) (Ping timeout: 260 seconds) |
| 2021-05-07 13:11:07 | <fkjc> | Does anyone know any resources on writing custom Cabal build scripts? I need to generate some library code before building, but it is not really obvious to me how to do this and the documentation is pretty sparse... |
| 2021-05-07 13:12:55 | → | Guest18158 joins (~joseph@2603-7000-7607-112b-351c-7687-8787-1bee.res6.spectrum.com) |
| 2021-05-07 13:13:15 | → | nbloomf joins (~nbloomf@2600:1700:ad14:3020:3c82:1c53:1e38:e2d9) |
| 2021-05-07 13:13:20 | × | royal_screwup213 quits (52254809@gateway/web/cgi-irc/kiwiirc.com/ip.82.37.72.9) (Quit: Connection closed) |
| 2021-05-07 13:13:38 | → | royal_screwup213 joins (52254809@gateway/web/cgi-irc/kiwiirc.com/ip.82.37.72.9) |
| 2021-05-07 13:13:48 | → | hiroaki joins (~hiroaki@2a02:8108:8c40:2bb8:26bd:1b9c:1bb0:c59b) |
| 2021-05-07 13:17:59 | × | geekosaur quits (930099da@rrcs-147-0-153-218.central.biz.rr.com) (Quit: Connection closed) |
| 2021-05-07 13:18:14 | × | royal_screwup213 quits (52254809@gateway/web/cgi-irc/kiwiirc.com/ip.82.37.72.9) (Ping timeout: 252 seconds) |
| 2021-05-07 13:21:28 | <Gurkenglas> | Should I define my partially ordered sets on the type level or the value level? |
| 2021-05-07 13:21:56 | × | petersen quits (~petersen@redhat/juhp) (Read error: Connection reset by peer) |
| 2021-05-07 13:21:57 | <boxscape> | probably depends on what you want to do with them |
| 2021-05-07 13:22:05 | → | hypercube joins (~hypercube@2603-6011-f901-9e5b-0000-0000-0000-08cf.res6.spectrum.com) |
| 2021-05-07 13:22:26 | × | geowiesnot quits (~user@87-89-181-157.abo.bbox.fr) (Ping timeout: 240 seconds) |
| 2021-05-07 13:22:45 | <Gurkenglas> | Hmm if I'm gonna have a bunch of typeclasses defined on them and calculate one graph per type I should probably do the value level instead. |
| 2021-05-07 13:23:05 | × | nan` quits (~nan`@unaffiliated/nan/x-5405850) (Quit: leaving) |
| 2021-05-07 13:23:23 | <Gurkenglas> | (There's probably some language out there where the type and value level are the same) |
| 2021-05-07 13:24:07 | <__monty__> | Most dependently typed languages. |
| 2021-05-07 13:28:02 | × | nbloomf quits (~nbloomf@2600:1700:ad14:3020:3c82:1c53:1e38:e2d9) (Quit: My MacBook has gone to sleep. ZZZzzz…) |
| 2021-05-07 13:28:20 | → | m_shiraeeshi joins (~shiraeesh@5.101.59.1) |
| 2021-05-07 13:28:25 | <boxscape> | Haskell is moving in that direction with -XDataKinds |
| 2021-05-07 13:29:18 | <boxscape> | and at least the type and kind level (and everything higher) is unified |
All times are in UTC.