Newest at the top
2025-03-10 12:11:33 +0100 | ezzieyguywuf | (~Unknown@user/ezzieyguywuf) ezzieyguywuf |
2025-03-10 12:10:08 +0100 | merijn | (~merijn@77.242.116.146) merijn |
2025-03-10 12:07:47 +0100 | <jackdk> | Square2: You can, but you'll need to hoist your `f` into an actual `Functor`to be able to tear the value back down. You can see this trick put to good use in https://blog.ocharles.org.uk/posts/2017-08-23-extensible-effects-and-transformers.html |
2025-03-10 12:02:38 +0100 | gmg | (~user@user/gehmehgeh) (Quit: Leaving) |
2025-03-10 12:02:00 +0100 | fiadl | (~user@p5b0f3bec.dip0.t-ipconnect.de) (Remote host closed the connection) |
2025-03-10 12:00:51 +0100 | <Square2> | any "f :: * -> *" that is |
2025-03-10 11:59:08 +0100 | <Square2> | I'm wondering about the Coyoneda lemma. Seems I can turn any type f into a Functor using Coyoneda lemma. Similarly I can turn that f in to Monad using : Free (Coyoneda f). Or am I missing something? |
2025-03-10 11:57:27 +0100 | merijn | (~merijn@77.242.116.146) (Ping timeout: 252 seconds) |
2025-03-10 11:55:22 +0100 | picnoir | (~picnoir@about/aquilenet/vodoo/NinjaTrappeur) NinjaTrappeur |
2025-03-10 11:55:12 +0100 | fiadl | (~user@p5b0f3bec.dip0.t-ipconnect.de) |
2025-03-10 11:53:58 +0100 | picnoir | (~picnoir@about/aquilenet/vodoo/NinjaTrappeur) (Quit: WeeChat 4.5.1) |
2025-03-10 11:43:56 +0100 | vanishingideal | (~vanishing@user/vanishingideal) vanishingideal |
2025-03-10 11:40:36 +0100 | alfiee | (~alfiee@user/alfiee) (Ping timeout: 252 seconds) |
2025-03-10 11:39:54 +0100 | fp | (~Thunderbi@2001:708:20:1406::1370) (Ping timeout: 260 seconds) |
2025-03-10 11:37:42 +0100 | alexherbo2 | (~alexherbo@2a02-8440-3505-a309-316c-408c-4c06-8723.rev.sfr.net) (Remote host closed the connection) |
2025-03-10 11:36:29 +0100 | alfiee | (~alfiee@user/alfiee) alfiee |
2025-03-10 11:23:00 +0100 | xff0x | (~xff0x@fsb6a9491c.tkyc517.ap.nuro.jp) (Ping timeout: 252 seconds) |
2025-03-10 11:20:55 +0100 | greenOcean | (~greenOcea@2405:3800:854:8593:b4d0:2dff:fe2a:5734) |
2025-03-10 11:15:37 +0100 | alexherbo2 | (~alexherbo@2a02-8440-3505-a309-316c-408c-4c06-8723.rev.sfr.net) alexherbo2 |
2025-03-10 11:02:28 +0100 | uam | (uid360535@id-360535.hampstead.irccloud.com) (Quit: Connection closed for inactivity) |
2025-03-10 11:02:25 +0100 | nschoe | (~nschoe@82-65-202-30.subs.proxad.net) (Ping timeout: 248 seconds) |
2025-03-10 10:59:41 +0100 | nschoe- | (~nschoe@2a01:e0a:8e:a190:390c:4fc2:cea5:b72a) |
2025-03-10 10:57:57 +0100 | tabaqui1 | (~root@87.200.129.102) tabaqui |
2025-03-10 10:55:18 +0100 | alfiee | (~alfiee@user/alfiee) (Ping timeout: 276 seconds) |
2025-03-10 10:50:45 +0100 | alfiee | (~alfiee@user/alfiee) alfiee |
2025-03-10 10:46:54 +0100 | arahael | (~arahael@user/arahael) arahael |
2025-03-10 10:46:24 +0100 | byte | (~mu@user/byte) byte |
2025-03-10 10:44:29 +0100 | merijn | (~merijn@77.242.116.146) merijn |
2025-03-10 10:43:58 +0100 | byte | (~mu@user/byte) (Read error: Connection reset by peer) |
2025-03-10 10:40:16 +0100 | sord937 | (~sord937@gateway/tor-sasl/sord937) sord937 |
2025-03-10 10:39:55 +0100 | sord937 | (~sord937@gateway/tor-sasl/sord937) (Remote host closed the connection) |
2025-03-10 10:35:38 +0100 | __monty__ | (~toonn@user/toonn) toonn |
2025-03-10 10:34:57 +0100 | ljdarj | (~Thunderbi@user/ljdarj) ljdarj |
2025-03-10 10:34:39 +0100 | ljdarj | (~Thunderbi@user/ljdarj) (Quit: ljdarj) |
2025-03-10 10:34:18 +0100 | merijn | (~merijn@77.242.116.146) (Ping timeout: 246 seconds) |
2025-03-10 10:30:49 +0100 | alexherbo2 | (~alexherbo@2a02-8440-3505-a309-641e-34a2-2fd3-1364.rev.sfr.net) (Remote host closed the connection) |
2025-03-10 10:25:47 +0100 | arahael | (~arahael@user/arahael) (Remote host closed the connection) |
2025-03-10 10:25:40 +0100 | mange | (~user@user/mange) mange |
2025-03-10 10:20:36 +0100 | fp | (~Thunderbi@2001:708:20:1406::1370) fp |
2025-03-10 10:18:27 +0100 | fp | (~Thunderbi@wireless-86-50-140-47.open.aalto.fi) (Ping timeout: 244 seconds) |
2025-03-10 10:16:18 +0100 | Everything | (~Everythin@94.153.10.203) (Ping timeout: 276 seconds) |
2025-03-10 10:13:59 +0100 | fp | (~Thunderbi@wireless-86-50-140-47.open.aalto.fi) fp |
2025-03-10 10:13:58 +0100 | <tomsmeding> | literate programming is just a way to generate such a document in a way that the compiler still checks your code :) |
2025-03-10 10:13:42 +0100 | <tomsmeding> | You don't even need literate programming, you can just write in your document "now we first look at the definition of a different function, before we continue with the equations of foo" |
2025-03-10 10:13:19 +0100 | tt12310978324354 | (~tt1231@2603:6010:8700:4a81:219f:50d3:618a:a6ee) (Ping timeout: 252 seconds) |
2025-03-10 10:12:26 +0100 | <tomsmeding> | Code is read more often than it is written, and if you have something larger than just a single tutorial, I'd rather see the equations of a particular function together than spread all over a file! |
2025-03-10 10:11:53 +0100 | <tomsmeding> | As you say, that is useful for explanation, but we have literate programming tools for that if you want that so badly |
2025-03-10 10:11:28 +0100 | <tomsmeding> | monochrom: Why does the linear structure of code need to follow the chronological development process? |
2025-03-10 10:09:07 +0100 | ljdarj | (~Thunderbi@user/ljdarj) ljdarj |
2025-03-10 10:09:02 +0100 | Smiles | (uid551636@id-551636.lymington.irccloud.com) Smiles |