Newest at the top
| 2025-03-30 03:49:10 +0200 | <haskellbridge> | <thirdofmay18081814goya> right |
| 2025-03-30 03:49:03 +0200 | Tuplanolla | (~Tuplanoll@91-159-69-59.elisa-laajakaista.fi) (Quit: Leaving.) |
| 2025-03-30 03:49:01 +0200 | <EvanR> | ignoring bottoms |
| 2025-03-30 03:48:18 +0200 | <EvanR> | thirdofmay18081814goya, data Nat = Z | S !Nat |
| 2025-03-30 03:47:08 +0200 | roconnor | (~quassel@rocq/roconnor) roconnor |
| 2025-03-30 03:46:27 +0200 | roconnor | (~quassel@rocq/roconnor) (Ping timeout: 246 seconds) |
| 2025-03-30 03:38:24 +0200 | toby-bro | (~toby-bro@user/toby-bro) (Ping timeout: 272 seconds) |
| 2025-03-30 03:32:58 +0200 | ljdarj | (~Thunderbi@user/ljdarj) (Ping timeout: 244 seconds) |
| 2025-03-30 03:26:51 +0200 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) (Ping timeout: 246 seconds) |
| 2025-03-30 03:25:46 +0200 | <haskellbridge> | <jv> 'd |
| 2025-03-30 03:21:35 +0200 | harveypwca | (~harveypwc@2601:246:d080:f6e0:27d6:8cc7:eca9:c46c) |
| 2025-03-30 03:18:01 +0200 | ChaiTRex | (~ChaiTRex@user/chaitrex) ChaiTRex |
| 2025-03-30 03:13:11 +0200 | hattckory | (~hattckory@70.27.118.207) |
| 2025-03-30 03:12:28 +0200 | <geekosaur> | well, arguably so are uncountably infinite ones, at least as results 🙂 |
| 2025-03-30 03:12:16 +0200 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) peterbecich |
| 2025-03-30 03:11:51 +0200 | <geekosaur> | (only a slight overstatement) |
| 2025-03-30 03:11:28 +0200 | <geekosaur> | heh. let's put it this way: countably infinite Gödel numbers are considered a feature for their use case |
| 2025-03-30 03:07:53 +0200 | <haskellbridge> | <thirdofmay18081814goya> will do, thanks a lot for the reference. am literally looking for anything that works lol |
| 2025-03-30 03:07:23 +0200 | <monochrom> | Sure, if module names are still unambiguous like 20 years ago. |
| 2025-03-30 03:06:42 +0200 | <haskellbridge> | <thirdofmay18081814goya> "Data.Binary" that is? |
| 2025-03-30 03:06:20 +0200 | ChaiTRex | (~ChaiTRex@user/chaitrex) (Quit: ChaiTRex) |
| 2025-03-30 03:06:13 +0200 | <monochrom> | You should look at the binary package and what it does to "instance Binary (Tree e)" |
| 2025-03-30 03:05:52 +0200 | <haskellbridge> | <thirdofmay18081814goya> any alternative |
| 2025-03-30 03:05:43 +0200 | <haskellbridge> | <thirdofmay18081814goya> monochrom: what's an alternative? |
| 2025-03-30 03:04:49 +0200 | <geekosaur> | ^ |
| 2025-03-30 03:03:53 +0200 | <monochrom> | Unpopular opinion: But Gödel numbers is terribly preoccupied with gross inefficiency. |
| 2025-03-30 03:01:37 +0200 | sprotte24_ | (~sprotte24@p200300d16f1c4e0098c546d077431e36.dip0.t-ipconnect.de) (Quit: Leaving) |
| 2025-03-30 03:00:49 +0200 | causal | (~eric@50.35.84.231) (Quit: WeeChat 4.5.1) |
| 2025-03-30 01:59:37 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-03-30 01:58:23 +0100 | <haskellbridge> | <thirdofmay18081814goya> not terribly preoccupied with efficiency atm |
| 2025-03-30 01:58:14 +0100 | <haskellbridge> | <thirdofmay18081814goya> wrt Godel coding, beginning to read http://foibg.com/ijita/vol17/ijita17-1-p02.pdf |
| 2025-03-30 01:56:20 +0100 | <geekosaur> | (My comment about Gödel coding was only half a joke; it would certainly work but would be overkill and probably extremely inefficient for your purpose) |
| 2025-03-30 01:55:38 +0100 | <geekosaur> | how you define it would depend on what you intend to do with it |
| 2025-03-30 01:55:26 +0100 | <geekosaur> | that's a somewhat weird way to put it. I would say that you can define such a function, not that one exists with a particular API |
| 2025-03-30 01:51:12 +0100 | <haskellbridge> | <thirdofmay18081814goya> what would be the API to access it? |
| 2025-03-30 01:50:32 +0100 | <haskellbridge> | <thirdofmay18081814goya> so rephrasing: there is an invertible serialization function for "Tree Natural", correct? |
| 2025-03-30 01:48:49 +0100 | <haskellbridge> | <thirdofmay18081814goya> ah that clears it up, ty |
| 2025-03-30 01:48:33 +0100 | <Leary> | thirdofmay: |Word| = |Int|; |Natural| = |Integer| = omega |
| 2025-03-30 01:48:31 +0100 | <lambdabot> | 1000000000000000000000000000000000000000000000000000000000000000000000000000... |
| 2025-03-30 01:48:30 +0100 | <monochrom> | > 10^100 :: Natural |
| 2025-03-30 01:48:23 +0100 | <haskellbridge> | <thirdofmay18081814goya> so is there no type that has the size of the set of natural numbers in haskell? |
| 2025-03-30 01:47:48 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 244 seconds) |
| 2025-03-30 01:47:06 +0100 | <haskellbridge> | <Bowuigi> Not only implementation-wise, but also because every computation of type Natural is a Natural, including "1 + undefined" |
| 2025-03-30 01:46:53 +0100 | <haskellbridge> | <thirdofmay18081814goya> no it seems, assuming "Natural" has the size of the set of unsigned integers, it is a finite set too |
| 2025-03-30 01:45:56 +0100 | <haskellbridge> | <Bowuigi> Also is Natural the same size as the set of natural numbers? It has bottoms too |
| 2025-03-30 01:44:26 +0100 | <monochrom> | In Haskell2010 it's simulataneously "UB" and "implementation-defined". The exact quote: "The results of exceptional conditions (such as overflow or underflow) on the fixed-precision numeric types are undefined; an implementation may choose error (⊥, semantically), a truncated value, or a special value such as infinity, indefinite, etc." |
| 2025-03-30 01:44:19 +0100 | ChaiTRex | (~ChaiTRex@user/chaitrex) ChaiTRex |
| 2025-03-30 01:44:15 +0100 | <haskellbridge> | <Bowuigi> No, Natural is Integer but unsigned |
| 2025-03-30 01:44:11 +0100 | <haskellbridge> | <thirdofmay18081814goya> and "| Natural | = | Set of natural numbers |" |
| 2025-03-30 01:43:47 +0100 | <haskellbridge> | <thirdofmay18081814goya> hm so there's an invertible serialization/deserialization function for "Tree Natural"? (or "Tree Word", assuming I understand correctly that "| Word | = | Natural |"?) |