Newest at the top
2024-03-29 12:28:06 +0100 | MajorBiscuit | (~MajorBisc@2001:1c00:31c:8400:3d3d:8874:417f:fbf3) (Ping timeout: 256 seconds) |
2024-03-29 12:20:25 +0100 | __monty__ | (~toonn@user/toonn) |
2024-03-29 12:17:47 +0100 | tv | (~tv@user/tv) |
2024-03-29 12:14:33 +0100 | ncf | . o O ( is haskell indented or discodered? ) |
2024-03-29 12:13:10 +0100 | ski | would indent the opening braces more than the data constructors, fwiw, Arsen |
2024-03-29 12:10:49 +0100 | <lambdabot> | a -> b -> b |
2024-03-29 12:10:48 +0100 | <ski> | @type Control.Parallel.pseq |
2024-03-29 12:04:50 +0100 | tv | (~tv@user/tv) (Ping timeout: 268 seconds) |
2024-03-29 11:59:40 +0100 | wootehfoot | (~wootehfoo@user/wootehfoot) |
2024-03-29 11:59:05 +0100 | alexherbo2 | (~alexherbo@2a02-8440-3440-0ba5-dd7f-585d-7bb4-4d97.rev.sfr.net) |
2024-03-29 11:56:53 +0100 | <[exa]> | tahnks a lot! |
2024-03-29 11:56:50 +0100 | <[exa]> | perfect |
2024-03-29 11:56:40 +0100 | <[exa]> | I'm planning to shallowly `seq` the stuff anyway before testing |
2024-03-29 11:56:35 +0100 | tt12310 | (~tt1231@2603-6010-8700-4a81-219f-50d3-618a-a6ee.res6.spectrum.com) (Ping timeout: 260 seconds) |
2024-03-29 11:56:12 +0100 | <[exa]> | yeah that's ok for me |
2024-03-29 11:55:49 +0100 | <c_wraith> | ie, it won't evaluate its arguments, so two things that might be the same when evaluated would return 0# |
2024-03-29 11:55:48 +0100 | [exa] | wondering which case is positive and which is negative |
2024-03-29 11:55:16 +0100 | <c_wraith> | I think it can have false negatives, but not false positives. |
2024-03-29 11:54:29 +0100 | MajorBiscuit | (~MajorBisc@2001:1c00:31c:8400:3d3d:8874:417f:fbf3) |
2024-03-29 11:52:02 +0100 | <[exa]> | thanks! |
2024-03-29 11:51:56 +0100 | <[exa]> | ok good I like the `reallyUnsafe` prefix |
2024-03-29 11:50:15 +0100 | <c_wraith> | https://hackage.haskell.org/package/base-4.19.1.0/docs/GHC-Exts.html#v:reallyUnsafePtrEquality |
2024-03-29 11:49:17 +0100 | <[exa]> | Is there something that would allow me to (invisibly and very naively) compare addresses of 2 things to detect if they are different? The use case would be something updating a structure (rewriting) and me detecting whether it (by any accident) changed. In STG it would literally be a comparison of 2 pointers, false positives are OK. I'd say this would be near `unsafeCoerce` but can't find anything |
2024-03-29 11:44:53 +0100 | hiredman | (~hiredman@frontier1.downey.family) |
2024-03-29 11:42:30 +0100 | myxos | (~myxos@065-028-251-121.inf.spectrum.com) |
2024-03-29 11:41:28 +0100 | <cheater> | hmm right |
2024-03-29 11:38:15 +0100 | myxokephale | (~myxos@065-028-251-121.inf.spectrum.com) (Remote host closed the connection) |
2024-03-29 11:37:42 +0100 | mei | (~mei@user/mei) (Ping timeout: 268 seconds) |
2024-03-29 11:35:32 +0100 | <c_wraith> | Honestly, I don't really understand the use case for HList. vinyl at least names the fields so that they can be order-independent |
2024-03-29 11:34:49 +0100 | <lyxia> | a lot of the libraries that "solve" the record problem are some opinionated API on top of hlists. |
2024-03-29 11:33:38 +0100 | <lyxia> | There's Hlist, vinyl, and a lot of the effect libraries also roll their own variant of it. |
2024-03-29 11:32:48 +0100 | <lyxia> | it's a widely known concept but there is no standard implementation because there are so many trade offs |
2024-03-29 11:28:29 +0100 | gmg | (~user@user/gehmehgeh) (Quit: Leaving) |
2024-03-29 11:24:23 +0100 | hiredman | (~hiredman@frontier1.downey.family) (Ping timeout: 260 seconds) |
2024-03-29 11:23:47 +0100 | <cheater> | does it come in some package? |
2024-03-29 11:23:44 +0100 | <cheater> | is HList like a widely used thing? |
2024-03-29 11:23:23 +0100 | <cheater> | thanks |
2024-03-29 11:23:20 +0100 | <cheater> | ok, i guess this makes sense |
2024-03-29 11:23:02 +0100 | <cheater> | hmm |
2024-03-29 11:21:44 +0100 | <cheater> | i'll need a few stiff shots before i can understand that |
2024-03-29 11:17:07 +0100 | <yahb2> | Proxy @Int :~ Proxy @Char :~ Nil ; :: (c Int, c Char) => HList c Proxy '[Int, Char] |
2024-03-29 11:17:07 +0100 | <[Leary]> | % :t Proxy @Int :~ Proxy @Char :~ Nil |
2024-03-29 11:17:02 +0100 | <yahb2> | <no output> |
2024-03-29 11:17:02 +0100 | <[Leary]> | % data HList c f xs where { Nil :: HList c f '[]; (:~) :: c x => f x -> HList c f xs -> HList c f (x:xs) }; infixr 6 :~ |
2024-03-29 11:13:23 +0100 | <cheater> | would like to figure out how.. |
2024-03-29 11:13:13 +0100 | <cheater> | guess not |
2024-03-29 11:11:17 +0100 | Tuplanolla | (~Tuplanoll@91-159-69-59.elisa-laajakaista.fi) |
2024-03-29 11:09:18 +0100 | EvanR | (~EvanR@user/evanr) |
2024-03-29 11:09:03 +0100 | EvanR | (~EvanR@user/evanr) (Remote host closed the connection) |
2024-03-29 11:09:01 +0100 | <cheater> | can i have a list that has multiple different proxies inside? like [Proxy @Type1, Proxy @Type2, ...] |