2025/09/30

Newest at the top

2025-09-30 11:32:43 +0200ljdarj1ljdarj
2025-09-30 11:32:42 +0200ljdarj(~Thunderbi@user/ljdarj) (Ping timeout: 248 seconds)
2025-09-30 11:32:34 +0200bgg_(~bgg@2a01:e0a:819:1510:573a:3145:6af7:e234) (Read error: Connection reset by peer)
2025-09-30 11:31:17 +0200ljdarj1(~Thunderbi@user/ljdarj) ljdarj
2025-09-30 11:31:06 +0200bgg__(~bgg@2a01:e0a:819:1510:573a:3145:6af7:e234)
2025-09-30 11:23:55 +0200tzh(~tzh@c-76-115-131-146.hsd1.or.comcast.net) (Quit: zzz)
2025-09-30 11:23:38 +0200 <ski> well, #mercury does exist (and #curry)
2025-09-30 11:21:08 +0200trickard_(~trickard@cpe-50-98-47-163.wireline.com.au)
2025-09-30 11:20:54 +0200 <[exa]> lol
2025-09-30 11:20:45 +0200tomsmedingis building a GHC HEAD to test [exa]'s thing
2025-09-30 11:20:37 +0200YuutaW(~YuutaW@alice.yuuta.moe) YuutaW
2025-09-30 11:20:34 +0200trickard(~trickard@cpe-50-98-47-163.wireline.com.au) (Ping timeout: 244 seconds)
2025-09-30 11:20:04 +0200 <tomsmeding> should we?
2025-09-30 11:19:54 +0200 <[exa]> we should have #haskell-prolog
2025-09-30 11:19:24 +0200YuutaW(~YuutaW@alice.yuuta.moe) (Ping timeout: 252 seconds)
2025-09-30 11:18:24 +0200 <tomsmeding> yes
2025-09-30 11:18:20 +0200 <ski> it already does support the output context
2025-09-30 11:18:07 +0200 <ski> indeed
2025-09-30 11:18:01 +0200 <tomsmeding> "ought to be possible", as in, "would be nice but GHC does not support this" :p
2025-09-30 11:18:01 +0200fp(~Thunderbi@2001:708:20:1406::10c5) fp
2025-09-30 11:17:26 +0200 <ski> (or, s/Is/Id/, maybe)
2025-09-30 11:16:33 +0200 <ski> Is x = x
2025-09-30 11:16:27 +0200 <ski> where
2025-09-30 11:16:25 +0200 <ski> pattern Is x <- ((x ==) -> True)
2025-09-30 11:16:04 +0200 <ski> pattern Is :: Eq a => a -> () => a
2025-09-30 11:16:00 +0200ByronJohnson(~bairyn@MAIL.DIGITALKINGDOM.ORG) ByronJohnson
2025-09-30 11:15:17 +0200 <ski> with
2025-09-30 11:15:15 +0200 <ski> pattern Append (x:xs) ys = Is x : Append xs ys
2025-09-30 11:14:49 +0200 <ski> or, you could restate the latter as
2025-09-30 11:14:36 +0200 <ski> pattern Append (x0:xs) ys = x1 : Append xs ys | x0 == x1
2025-09-30 11:14:34 +0200 <ski> pattern Append [ ] ys = ys
2025-09-30 11:14:25 +0200Lord_of_Life(~Lord@user/lord-of-life/x-2819915) Lord_of_Life
2025-09-30 11:14:02 +0200Lord_of_Life(~Lord@user/lord-of-life/x-2819915) (Quit: Laa shay'a waqi'un moutlaq bale kouloun moumkine)
2025-09-30 11:11:47 +0200 <[exa]> ski: ok whew
2025-09-30 11:10:21 +0200tromp(~textual@2001:1c00:3487:1b00:ec31:dae7:cc09:de7b)
2025-09-30 11:07:04 +0200dhil(~dhil@5.151.29.138) dhil
2025-09-30 11:06:07 +0200merijn(~merijn@77.242.116.146) merijn
2025-09-30 11:05:47 +0200Enrico63(~Enrico63@2a0b:e541:10d0:0:9efc:e8ff:fe24:3213) (Client Quit)
2025-09-30 11:05:34 +0200 <ski> [exa],c_wraith : `pattern Append :: Eq a => [a] -> () => [a] -> [a]' ought to be possible, first comes input context and parameters, then output context and parameters, finally input result
2025-09-30 11:04:24 +0200Enrico63(~Enrico63@2a0b:e541:10d0:0:9efc:e8ff:fe24:3213) Enrico63
2025-09-30 11:02:21 +0200fp(~Thunderbi@2001:708:20:1406::10c5) (Ping timeout: 252 seconds)
2025-09-30 11:01:51 +0200 <lambdabot> Eq a => [a] -> [a] -> Maybe [a]
2025-09-30 11:01:50 +0200 <ski> @type stripPrefix
2025-09-30 11:01:49 +0200 <lambdabot> GHC.OldList, Data.List
2025-09-30 11:01:49 +0200 <ski> @index stripPrefix
2025-09-30 11:00:56 +0200merijn(~merijn@77.242.116.146) (Ping timeout: 244 seconds)
2025-09-30 10:54:18 +0200ByronJohnson(~bairyn@MAIL.DIGITALKINGDOM.ORG) (Ping timeout: 248 seconds)
2025-09-30 10:54:17 +0200merijn(~merijn@77.242.116.146) merijn
2025-09-30 10:50:17 +0200tromp(~textual@2001:1c00:3487:1b00:ec31:dae7:cc09:de7b) (Quit: My iMac has gone to sleep. ZZZzzz…)
2025-09-30 10:45:31 +0200ByronJohnson(~bairyn@MAIL.DIGITALKINGDOM.ORG) ByronJohnson