Newest at the top
| 2024-09-30 08:16:04 +0200 | Xe | (~cadey@perl/impostor/xe) (Ping timeout: 260 seconds) |
| 2024-09-30 08:13:07 +0200 | youthlic | (~Thunderbi@user/youthlic) youthlic |
| 2024-09-30 08:10:37 +0200 | youthlic | (~Thunderbi@user/youthlic) (Remote host closed the connection) |
| 2024-09-30 08:07:50 +0200 | alp | (~alp@user/alp) alp |
| 2024-09-30 08:07:50 +0200 | alp | (~alp@2001:861:e3d6:8f80:5ec8:1cec:7a:413a) (Changing host) |
| 2024-09-30 08:07:48 +0200 | alp | (~alp@2001:861:e3d6:8f80:5ec8:1cec:7a:413a) |
| 2024-09-30 08:07:30 +0200 | alp | (~alp@user/alp) (Remote host closed the connection) |
| 2024-09-30 08:06:13 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) (Ping timeout: 248 seconds) |
| 2024-09-30 08:03:33 +0200 | bliminse | (~bliminse@user/bliminse) bliminse |
| 2024-09-30 08:01:07 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) merijn |
| 2024-09-30 07:56:03 +0200 | floyza | (~gavin@h69-11-148-150.kndrid.broadband.dynamic.tds.net) (Remote host closed the connection) |
| 2024-09-30 07:55:15 +0200 | floyza | (~gavin@h69-11-148-150.kndrid.broadband.dynamic.tds.net) gdown |
| 2024-09-30 07:54:57 +0200 | gdown | (~gavin@h69-11-148-150.kndrid.broadband.dynamic.tds.net) (Remote host closed the connection) |
| 2024-09-30 07:54:42 +0200 | gdown | (~gavin@h69-11-148-150.kndrid.broadband.dynamic.tds.net) gdown |
| 2024-09-30 07:54:25 +0200 | gdown | (~gavin@h69-11-148-150.kndrid.broadband.dynamic.tds.net) (Remote host closed the connection) |
| 2024-09-30 07:54:21 +0200 | acidjnk | (~acidjnk@p200300d6e72cfb276c1c454e32c34a99.dip0.t-ipconnect.de) acidjnk |
| 2024-09-30 07:54:07 +0200 | <Axman6> | That just sounds like the reasoning I already have! |
| 2024-09-30 07:53:53 +0200 | gdown | (~gavin@h69-11-148-150.kndrid.broadband.dynamic.tds.net) gdown |
| 2024-09-30 07:53:36 +0200 | floyza | (~gavin@h69-11-148-150.kndrid.broadband.dynamic.tds.net) (Remote host closed the connection) |
| 2024-09-30 07:52:27 +0200 | gdown | floyza |
| 2024-09-30 07:50:31 +0200 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) (Ping timeout: 252 seconds) |
| 2024-09-30 07:50:09 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) (Ping timeout: 252 seconds) |
| 2024-09-30 07:46:56 +0200 | gdown | (~gavin@h69-11-148-150.kndrid.broadband.dynamic.tds.net) gdown |
| 2024-09-30 07:45:20 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) merijn |
| 2024-09-30 07:35:17 +0200 | <haskellbridge> | <Bowuigi> Good luck and remember to Reason Isomorphically! |
| 2024-09-30 07:34:39 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) (Ping timeout: 265 seconds) |
| 2024-09-30 07:33:35 +0200 | <haskellbridge> | <thirdofmay18081814goya> it's a good idea ty for recommendation! |
| 2024-09-30 07:33:18 +0200 | rvalue | (~rvalue@user/rvalue) (Ping timeout: 276 seconds) |
| 2024-09-30 07:33:17 +0200 | <haskellbridge> | <Bowuigi> Yeah, you might even be able to skip over some cases by sort of unrolling loops and simplifying sums, like, "List a = 1 + (a * rec)" being expanded to "a * a * ... * 1", that is, "a^n". Might not happen on every tree but it can be useful |
| 2024-09-30 07:31:01 +0200 | andrewboltachev | (~andrey@178.141.123.3) andrewboltachev |
| 2024-09-30 07:30:09 +0200 | <haskellbridge> | <thirdofmay18081814goya> this could work |
| 2024-09-30 07:30:08 +0200 | Sgeo | (~Sgeo@user/sgeo) (Read error: Connection reset by peer) |
| 2024-09-30 07:30:07 +0200 | <haskellbridge> | <thirdofmay18081814goya> right |
| 2024-09-30 07:30:00 +0200 | <haskellbridge> | <thirdofmay18081814goya> yeah any tree is just some datatype defined through a fixpoint |
| 2024-09-30 07:29:45 +0200 | <haskellbridge> | <thirdofmay18081814goya> hm right |
| 2024-09-30 07:29:31 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) merijn |
| 2024-09-30 07:29:02 +0200 | <haskellbridge> | <Bowuigi> thirdofmay18081814goya which kinds of transformations on trees? Recursion schemes may help, specially cata. You get equational reasoning for free too |
| 2024-09-30 07:23:04 +0200 | ash3en | (~Thunderbi@2a03:7846:b6eb:101:93ac:a90a:da67:f207) (Client Quit) |
| 2024-09-30 07:20:13 +0200 | alp | (~alp@user/alp) alp |
| 2024-09-30 07:20:13 +0200 | alp | (~alp@2001:861:e3d6:8f80:8ed3:89ad:bffe:2596) (Changing host) |
| 2024-09-30 07:20:07 +0200 | alp | (~alp@2001:861:e3d6:8f80:8ed3:89ad:bffe:2596) |
| 2024-09-30 07:19:00 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) (Ping timeout: 276 seconds) |
| 2024-09-30 07:18:52 +0200 | <haskellbridge> | <thirdofmay18081814goya> will look up how to express them wrt adjecency relation, ty |
| 2024-09-30 07:18:36 +0200 | <haskellbridge> | <thirdofmay18081814goya> hm right, I was thinking what sort of mathematical representation would be useful for thinking about transformations on trees |
| 2024-09-30 07:18:23 +0200 | ash3en | (~Thunderbi@2a03:7846:b6eb:101:93ac:a90a:da67:f207) ash3en |
| 2024-09-30 07:15:02 +0200 | <Lears> | thirdofmay: I don't know what you're looking for---a tree is already a mathematical object. But as a graph its adjacency relation can be written as a matrix I suppose. |
| 2024-09-30 07:13:45 +0200 | merijn | (~merijn@204-220-045-062.dynamic.caiway.nl) merijn |
| 2024-09-30 07:11:58 +0200 | bliminse | (~bliminse@user/bliminse) (Quit: leaving) |
| 2024-09-30 07:11:05 +0200 | takuan | (~takuan@178-116-218-225.access.telenet.be) |
| 2024-09-30 07:10:01 +0200 | Laverga | (~Guest99@2806:2f0:1000:c843:4888:b302:2f13:2d52) (Ping timeout: 256 seconds) |