Newest at the top
| 2025-11-14 18:04:01 +0100 | <dolio> | But, like, what if you had that and it wasn't "you shouldn't be doing this." |
| 2025-11-14 18:03:46 +0100 | <dolio> | We never really got to fruition with that implementation, though. |
| 2025-11-14 18:03:41 +0100 | <haskellbridge> | <geekosaur> Bad time for me to be trying to do this |
| 2025-11-14 18:03:32 +0100 | <dolio> | Anyhow, back when I was working on ermine, I recall one thing we did was unsafe coerce exceptions into ST to try to borrow the more efficient handling that IO has. |
| 2025-11-14 18:03:30 +0100 | <comerijn> | This should be obvious, given javascript was named after java, which is substantially newer than both Python and Haskell (since Java cribbed immutable strings from python, and python cribbed list comprehensions from haskell) |
| 2025-11-14 18:03:23 +0100 | <haskellbridge> | <geekosaur> 3.0 not typing well |
| 2025-11-14 18:03:09 +0100 | tromp | (~textual@2001:1c00:3487:1b00:f8db:b16d:6074:eae9) (Quit: My iMac has gone to sleep. ZZZzzz…) |
| 2025-11-14 18:03:08 +0100 | Fijxu | (~Fijxu@user/fijxu) (Ping timeout: 256 seconds) |
| 2025-11-14 18:02:52 +0100 | <haskellbridge> | <geekosaur> Sorry I'm on my way to the store (sister's driving) |
| 2025-11-14 18:02:37 +0100 | <haskellbridge> | <Zemyla> Perl 32.0? I thought they were still working on Perl 6. |
| 2025-11-14 18:02:04 +0100 | <haskellbridge> | <geekosaur> Mm right about ja |
| 2025-11-14 18:00:49 +0100 | <comerijn> | Given that the first awk is from 1977 |
| 2025-11-14 18:00:32 +0100 | <comerijn> | I'm also confused by the qualifier "even" awk, as if awk is more modern than Perl and Python |
| 2025-11-14 17:59:58 +0100 | <kuribas> | I wish I could write production code in idris. |
| 2025-11-14 17:59:29 +0100 | <dolio> | That's the usual story. |
| 2025-11-14 17:58:00 +0100 | <comerijn> | iirc it was Lennart's compiler in Lazy ML? |
| 2025-11-14 17:57:44 +0100 | <comerijn> | The Haskell Committee started in 1987, predating python and the Haskell 1.0 was 1990. Not sure which compiler was first |
| 2025-11-14 17:55:28 +0100 | <comerijn> | geekosaur: Wikipedia lists "Python implementation began in December 1989.[43] Van Rossum first released it in 1991 as Python 0.9.0" |
| 2025-11-14 17:55:28 +0100 | <geekosaur> | which made it late 1980s |
| 2025-11-14 17:54:52 +0100 | <geekosaur> | python 1.0 and perl 32.0 came out the same week. I was comp.sources.misc moderator at the time and approved both |
| 2025-11-14 17:54:46 +0100 | acarrico1 | (~acarrico@pppoe-209-99-223-51.greenmountainaccess.net) |
| 2025-11-14 17:54:42 +0100 | <comerijn> | So Haskell 1.0 predates it by a year |
| 2025-11-14 17:54:09 +0100 | <comerijn> | Python's first public release was 1991 |
| 2025-11-14 17:54:03 +0100 | <comerijn> | perl and awk, sure |
| 2025-11-14 17:53:55 +0100 | <comerijn> | geekosaur: What? |
| 2025-11-14 17:53:55 +0100 | Googulator44 | (~Googulato@team.broadbit.hu) (Ping timeout: 250 seconds) |
| 2025-11-14 17:53:16 +0100 | <Leary> | loonycyborg: The issue with pure exceptions in Haskell is undefined evaluation order due to /laziness/. An effect system can easily provide deterministic, pure exception handling, so long as it imposes a strict sequencing of operations. |
| 2025-11-14 17:52:40 +0100 | <geekosaur> | and Javascript |
| 2025-11-14 17:52:33 +0100 | <geekosaur> | I mean, Perl, Python, and even awk already existed when Haskell was designed |
| 2025-11-14 17:52:15 +0100 | <geekosaur> | well, in Haskell's case it had more to do with it being originally intended as a teaching and FP exploration language |
| 2025-11-14 17:52:07 +0100 | img | (~img@user/img) img |
| 2025-11-14 17:50:50 +0100 | Googulator16 | (~Googulato@team.broadbit.hu) |
| 2025-11-14 17:50:49 +0100 | img | (~img@user/img) (Quit: ZNC 1.8.2 - https://znc.in) |
| 2025-11-14 17:44:36 +0100 | Googulator44 | (~Googulato@team.broadbit.hu) |
| 2025-11-14 17:44:28 +0100 | <haskellbridge> | <loonycyborg> It's just implementing such containers is generally done via hashing and it just wasn't a widespread thing when haskell was originally designed |
| 2025-11-14 17:44:21 +0100 | Googulator44 | (~Googulato@team.broadbit.hu) (Quit: Client closed) |
| 2025-11-14 17:43:21 +0100 | <haskellbridge> | <loonycyborg> In fact having a set(which is a list in no particular order) as a basic builtin type for a language like haskell would make sense I think :P |
| 2025-11-14 17:40:42 +0100 | bggd | (~bgg@2a01:e0a:819:1510:cb15:dfb4:31e5:1dfe) |
| 2025-11-14 17:40:08 +0100 | <haskellbridge> | <loonycyborg> so that should be unordered list which isn't a built-in feature in haskell |
| 2025-11-14 17:39:48 +0100 | <haskellbridge> | <loonycyborg> and then items in list can be in different order |
| 2025-11-14 17:39:26 +0100 | <haskellbridge> | <loonycyborg> I think it's possible to have pure exceptions too but then you'd have to get whole list of exceptions that happened, not random one of them |
| 2025-11-14 17:38:59 +0100 | Anarchos | (~Anarchos@91-161-254-16.subs.proxad.net) Anarchos |
| 2025-11-14 17:38:42 +0100 | <haskellbridge> | <loonycyborg> They're in IO only because the order they actually happen in at runtime is undefined. |
| 2025-11-14 17:34:14 +0100 | DetourNetworkUK | (~DetourNet@user/DetourNetworkUK) DetourNetworkUK |
| 2025-11-14 17:33:59 +0100 | Googulator | (~Googulato@team.broadbit.hu) (Ping timeout: 250 seconds) |
| 2025-11-14 17:31:40 +0100 | wootehfoot | (~wootehfoo@user/wootehfoot) (Read error: Connection reset by peer) |
| 2025-11-14 17:31:11 +0100 | <dolio> | I mean, that is how you get well performing exceptions in GHC, but what if you could have catchable exceptions that performed that well, but were sound to use outside of IO? |
| 2025-11-14 17:30:52 +0100 | DetourNetworkUK | (DetourNetw@user/DetourNetworkUK) (Read error: Connection reset by peer) |
| 2025-11-14 17:30:49 +0100 | <kuribas> | Still much better than a mess of global state in other languages. |
| 2025-11-14 17:30:46 +0100 | Inline | (~inlinE@2001-4dd7-ae97-0-4674-ae6d-2607-c022.ipv6dyn.netcologne.de) Inline |