Newest at the top
2024-08-22 07:47:28 +0200 | neuroevolutus | (~neuroevol@206.217.205.48) |
2024-08-22 07:44:53 +0200 | jle` | (~jle`@2603:8001:3b02:84d4:2809:1e29:1db7:65cb) |
2024-08-22 07:43:49 +0200 | jle` | (~jle`@2603:8001:3b02:84d4:b870:ffa:630b:cc32) (Ping timeout: 248 seconds) |
2024-08-22 07:41:57 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) (Ping timeout: 246 seconds) |
2024-08-22 07:38:16 +0200 | xff0x | (~xff0x@2405:6580:b080:900:a988:bd33:e56:4b1d) |
2024-08-22 07:37:36 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) |
2024-08-22 07:31:23 +0200 | ft | (~ft@p4fc2a393.dip0.t-ipconnect.de) (Quit: leaving) |
2024-08-22 07:30:47 +0200 | xff0x | (~xff0x@ai080132.d.east.v6connect.net) (Ping timeout: 244 seconds) |
2024-08-22 07:30:02 +0200 | Sgeo | (~Sgeo@user/sgeo) (Read error: Connection reset by peer) |
2024-08-22 07:29:47 +0200 | forell | (~forell@user/forell) |
2024-08-22 07:27:15 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) (Ping timeout: 246 seconds) |
2024-08-22 07:23:45 +0200 | <haskellbridge> | <thirdofmay18081814goya> Axman6: very cool! thanks |
2024-08-22 07:23:43 +0200 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) |
2024-08-22 07:22:53 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) |
2024-08-22 07:17:19 +0200 | <lambdabot> | [i,f i a,f (f i a) a,f (f (f i a) a) a,f (f (f (f i a) a) a) a] |
2024-08-22 07:17:18 +0200 | <Axman6> | > take 5 $ fix (\rec x -> x : rec (x `f` a)) i |
2024-08-22 07:11:45 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) (Ping timeout: 248 seconds) |
2024-08-22 07:07:28 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) |
2024-08-22 07:05:21 +0200 | rvalue | (~rvalue@user/rvalue) (Ping timeout: 276 seconds) |
2024-08-22 07:03:44 +0200 | wroathe | (~wroathe@user/wroathe) (Quit: leaving) |
2024-08-22 07:02:06 +0200 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) (Ping timeout: 276 seconds) |
2024-08-22 06:56:59 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) (Ping timeout: 265 seconds) |
2024-08-22 06:56:59 +0200 | tcard__ | (~tcard@2400:4051:5801:7500:1e90:74c3:2754:ce8a) |
2024-08-22 06:56:58 +0200 | tcard_ | (~tcard@2400:4051:5801:7500:1e90:74c3:2754:ce8a) (Read error: Connection reset by peer) |
2024-08-22 06:52:16 +0200 | <haskellbridge> | <thirdofmay18081814goya> hm i see |
2024-08-22 06:52:02 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) |
2024-08-22 06:48:21 +0200 | youthlic | (~Thunderbi@user/youthlic) |
2024-08-22 06:46:30 +0200 | michalz | (~michalz@185.246.207.205) |
2024-08-22 06:45:05 +0200 | shailangsa | (~shailangs@host86-185-58-242.range86-185.btcentralplus.com) |
2024-08-22 06:41:57 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) (Ping timeout: 276 seconds) |
2024-08-22 06:36:37 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) |
2024-08-22 06:35:56 +0200 | <lambdabot> | x:xs -> scanl f (f q x) xs |
2024-08-22 06:35:56 +0200 | <lambdabot> | [] -> [] |
2024-08-22 06:35:56 +0200 | <lambdabot> | scanl f q ls = q : case ls of |
2024-08-22 06:35:56 +0200 | <Axman6> | @src scanl |
2024-08-22 06:35:53 +0200 | <Axman6> | the easiest mechanical translation would be to expand out the definition of scanl and replace all calls to scanl f z with the first argument to the lambda |
2024-08-22 06:32:32 +0200 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) |
2024-08-22 06:32:28 +0200 | youthlic | (~Thunderbi@user/youthlic) (Ping timeout: 245 seconds) |
2024-08-22 06:30:22 +0200 | <haskellbridge> | <thirdofmay18081814goya> wrt. an implementation with "fix", it's not quite "fix (\x -> x ``f`` a)" nor "i ``f`` (fix (\x -> x ``f`` a)" |
2024-08-22 06:28:48 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) (Ping timeout: 246 seconds) |
2024-08-22 06:24:57 +0200 | Square | (~Square@user/square) (Ping timeout: 246 seconds) |
2024-08-22 06:24:21 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) |
2024-08-22 06:16:48 +0200 | <Leary> | With an `exists` quantifier we would also have an upper bound: `F A` <: `exists a. F a` |
2024-08-22 06:13:44 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) (Ping timeout: 260 seconds) |
2024-08-22 06:13:41 +0200 | <Leary> | Inst: With some care for your quantifiers, we have `forall a. F a` <: `F A`. Also: https://gist.github.com/LSLeary/0d3bf054f73c08910a6da2cfb49a4c28 |
2024-08-22 06:10:05 +0200 | <Inst> | as in, would [] :: [Int] be a subtype of [a]? |
2024-08-22 06:09:48 +0200 | <Inst> | [] :: [a], does it imply some form of subtyping? |
2024-08-22 06:09:31 +0200 | <Inst> | which does get me to thinking |
2024-08-22 06:08:55 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) |
2024-08-22 06:05:07 +0200 | wroathe | (~wroathe@user/wroathe) |