Newest at the top
| 2025-01-17 23:15:50 +0100 | merijn | (~merijn@128-137-045-062.dynamic.caiway.nl) merijn |
| 2025-01-17 23:13:40 +0100 | tnt2 | tnt1 |
| 2025-01-17 23:13:40 +0100 | tnt1 | (~Thunderbi@user/tnt1) (Ping timeout: 252 seconds) |
| 2025-01-17 23:13:21 +0100 | tnt2 | (~Thunderbi@user/tnt1) tnt1 |
| 2025-01-17 23:07:03 +0100 | tnt2 | tnt1 |
| 2025-01-17 23:07:03 +0100 | tnt1 | (~Thunderbi@user/tnt1) (Ping timeout: 252 seconds) |
| 2025-01-17 23:05:39 +0100 | tnt2 | (~Thunderbi@user/tnt1) tnt1 |
| 2025-01-17 23:04:52 +0100 | merijn | (~merijn@128-137-045-062.dynamic.caiway.nl) (Ping timeout: 252 seconds) |
| 2025-01-17 23:02:46 +0100 | ephilalethes | (~noumenon@182.0.203.121) (Quit: Leaving) |
| 2025-01-17 23:00:28 +0100 | merijn | (~merijn@128-137-045-062.dynamic.caiway.nl) merijn |
| 2025-01-17 23:00:20 +0100 | ystael | (~ystael@user/ystael) (Ping timeout: 244 seconds) |
| 2025-01-17 23:00:12 +0100 | Moyst | (~moyst@user/moyst) Moyst |
| 2025-01-17 22:58:57 +0100 | hueso | (~root@user/hueso) hueso |
| 2025-01-17 22:56:48 +0100 | hueso | (~root@user/hueso) (Ping timeout: 252 seconds) |
| 2025-01-17 22:54:05 +0100 | simplystuart | (~simplystu@c-75-75-152-164.hsd1.pa.comcast.net) |
| 2025-01-17 22:53:27 +0100 | fmira | (~user@user/fmira) (Remote host closed the connection) |
| 2025-01-17 22:52:02 +0100 | ljdarj | (~Thunderbi@user/ljdarj) ljdarj |
| 2025-01-17 22:49:59 +0100 | target_i | (~target_i@user/target-i/x-6023099) (Quit: leaving) |
| 2025-01-17 22:49:27 +0100 | merijn | (~merijn@128-137-045-062.dynamic.caiway.nl) (Ping timeout: 252 seconds) |
| 2025-01-17 22:47:36 +0100 | takuan | (~takuan@178-116-218-225.access.telenet.be) (Remote host closed the connection) |
| 2025-01-17 22:45:06 +0100 | merijn | (~merijn@128-137-045-062.dynamic.caiway.nl) merijn |
| 2025-01-17 22:43:28 +0100 | ash3en | (~Thunderbi@2a03:7846:b6eb:101:93ac:a90a:da67:f207) (Quit: ash3en) |
| 2025-01-17 22:34:40 +0100 | merijn | (~merijn@128-137-045-062.dynamic.caiway.nl) (Ping timeout: 265 seconds) |
| 2025-01-17 22:33:42 +0100 | j1n37 | (~j1n37@user/j1n37) j1n37 |
| 2025-01-17 22:32:02 +0100 | <energizer> | i guess to make an extensional toList they could accept a comparison function to decide on the traversal order |
| 2025-01-17 22:30:26 +0100 | Everything | (~Everythin@195.138.86.118) Everything |
| 2025-01-17 22:29:43 +0100 | merijn | (~merijn@128-137-045-062.dynamic.caiway.nl) merijn |
| 2025-01-17 22:28:51 +0100 | <energizer> | tomsmeding: interesting, thanks |
| 2025-01-17 22:28:19 +0100 | j1n37 | (~j1n37@user/j1n37) (Read error: Connection reset by peer) |
| 2025-01-17 22:28:09 +0100 | <haskellbridge> | <thirdofmay18081814goya> or traversable in finite time |
| 2025-01-17 22:27:27 +0100 | <haskellbridge> | <thirdofmay18081814goya> by turing-machine processable I mean, accessible in finite time by a turing-machine |
| 2025-01-17 22:26:56 +0100 | <haskellbridge> | <thirdofmay18081814goya> just to be clear: the statement is about datatypes, understood as type whose terms are turing-machine processable. it's not true of all types |
| 2025-01-17 22:25:32 +0100 | <tomsmeding> | https://hackage.haskell.org/package/unordered-containers-0.2.20/docs/Data-HashMap-Strict.html#t:Ha… |
| 2025-01-17 22:25:21 +0100 | <tomsmeding> | referring specifically to toList being different |
| 2025-01-17 22:25:03 +0100 | <tomsmeding> | energizer: the unordered-containers library has the following note in its docs: "Note that, in the presence of hash collisions, equal HashMaps may behave differently, i.e. extensionality may be violated:" |
| 2025-01-17 22:24:29 +0100 | j1n37 | (~j1n37@user/j1n37) j1n37 |
| 2025-01-17 22:24:14 +0100 | <energizer> | if two HashSets are equal, do their toList values necessarily produce lists in the same order? how does that work? |
| 2025-01-17 22:23:00 +0100 | simplystuart | (~simplystu@c-75-75-152-164.hsd1.pa.comcast.net) (Ping timeout: 246 seconds) |
| 2025-01-17 22:21:29 +0100 | <haskellbridge> | <thirdofmay18081814goya> so any polymorphic function is indexable by its countable universe (if we're talking datatypes, not types in general) |
| 2025-01-17 22:21:23 +0100 | j1n37 | (~j1n37@user/j1n37) (Read error: Connection reset by peer) |
| 2025-01-17 22:21:10 +0100 | <haskellbridge> | <thirdofmay18081814goya> the universe is countable by virtue of limited machine memory |
| 2025-01-17 22:21:05 +0100 | <geekosaur> | (well, strictly speaking you could Gödelize, but that leads to out of memory conditions) |
| 2025-01-17 22:20:31 +0100 | <geekosaur> | thirdofmay, no they don't. what's the injection for a polymorphic function? |
| 2025-01-17 22:20:06 +0100 | <geekosaur> | HashSet in unordered-containers, but that replaces Ord with Hashable |
| 2025-01-17 22:19:20 +0100 | <haskellbridge> | <thirdofmay18081814goya> all datatypes have an injection into the naturals, don't think so |
| 2025-01-17 22:18:57 +0100 | merijn | (~merijn@128-137-045-062.dynamic.caiway.nl) (Ping timeout: 252 seconds) |
| 2025-01-17 22:18:55 +0100 | <energizer> | (eg by using hashing instead of ordering) |
| 2025-01-17 22:18:52 +0100 | simplystuart | (~simplystu@c-75-75-152-164.hsd1.pa.comcast.net) |
| 2025-01-17 22:18:44 +0100 | j1n37 | (~j1n37@user/j1n37) j1n37 |
| 2025-01-17 22:18:11 +0100 | <energizer> | is there a set type that doesn't have the Ord requirement? |