Newest at the top
| 2025-02-26 10:45:55 +0100 | <cheater> | i think that's interesting enough. |
| 2025-02-26 10:45:51 +0100 | <tomsmeding> | if f and g are continuous and bijective, then they are homeomorphisms, for example |
| 2025-02-26 10:45:48 +0100 | zmt01 | (~zmt00@user/zmt00) (Ping timeout: 252 seconds) |
| 2025-02-26 10:45:44 +0100 | <cheater> | the only property is that if you start in one set, you can infinitely go between the two sets using f and g. possibly ending at some limit element or not. |
| 2025-02-26 10:45:02 +0100 | <tomsmeding> | cheater: if the functions have some equation relating them, then there may be appropriate terminology, but without any equation relating them, I don't think there's a word for this |
| 2025-02-26 10:44:34 +0100 | <cheater> | f and g are connected by the property i listed above: they are total on sets that contain each other's codomains |
| 2025-02-26 10:44:02 +0100 | <tomsmeding> | Leary: That's fair |
| 2025-02-26 10:43:42 +0100 | <tomsmeding> | (and that's usually modelled as a total function to Y + 1) |
| 2025-02-26 10:43:42 +0100 | <cheater> | they are total on their domains, but their domains don't have to line up like they do in my hypothesis |
| 2025-02-26 10:43:38 +0100 | kaskal | (~kaskal@84-115-238-111.cable.dynamic.surfer.at) kaskal |
| 2025-02-26 10:43:31 +0100 | <tomsmeding> | it's the concept of a "partial function" that needs explicit note |
| 2025-02-26 10:43:10 +0100 | <tomsmeding> | functions are total by default in mathematics |
| 2025-02-26 10:43:04 +0100 | <tomsmeding> | those are just a pair of functions |
| 2025-02-26 10:42:56 +0100 | <tomsmeding> | I don't see any connection between f and g here |
| 2025-02-26 10:42:55 +0100 | <cheater> | a pair of total functions between two sets going in opposite directions |
| 2025-02-26 10:42:40 +0100 | swamp_ | (~zmt00@user/zmt00) zmt00 |
| 2025-02-26 10:42:37 +0100 | <cheater> | yes |
| 2025-02-26 10:42:32 +0100 | <tomsmeding> | cheater: so then that first formula says that f is total? I.e. it returns a result for every x? |
| 2025-02-26 10:42:07 +0100 | <Leary> | Multiple terminologies can coexist. I also don't consider the language around /releases/ to conflict with the language for the version components. |
| 2025-02-26 10:41:56 +0100 | <cheater> | tomsmeding: yes. that's a shorthand. |
| 2025-02-26 10:41:16 +0100 | <tomsmeding> | though actually the GHC wiki terminology is rather close to this |
| 2025-02-26 10:40:32 +0100 | merijn | (~merijn@77.242.116.146) (Ping timeout: 244 seconds) |
| 2025-02-26 10:40:25 +0100 | <tomsmeding> | Leary: Well, then the GHC user guide disagrees, and the GHC wiki contests the nuance. :P |
| 2025-02-26 10:39:43 +0100 | <Leary> | tomsmeding: In line with HLS: 9.12 ~ major (version (numbers)); 1 ~ minor (version (number)). At least that's the language I would use; I doubt there's an official decree. |
| 2025-02-26 10:37:22 +0100 | <tomsmeding> | or something |
| 2025-02-26 10:37:13 +0100 | <tomsmeding> | perhaps you meant "\A x \in X \E y (f(x) = y)"? |
| 2025-02-26 10:36:59 +0100 | lxsameer | (~lxsameer@Serene/lxsameer) lxsameer |
| 2025-02-26 10:36:04 +0100 | <tomsmeding> | what do you mean with "\E f(x)"? |
| 2025-02-26 10:35:35 +0100 | <cheater> | what do you call a pair of functions in mathematics f, g, f: X -> Y and g: Y -> X such that \A x \in X \E f(x) and \A y \in Y \E g(y)? |
| 2025-02-26 10:35:34 +0100 | merijn | (~merijn@77.242.116.146) merijn |
| 2025-02-26 10:35:30 +0100 | rvalue | (~rvalue@user/rvalue) rvalue |
| 2025-02-26 10:34:35 +0100 | tzh | (~tzh@c-76-115-131-146.hsd1.or.comcast.net) (Quit: zzz) |
| 2025-02-26 10:33:18 +0100 | alfiee | (~alfiee@user/alfiee) (Ping timeout: 244 seconds) |
| 2025-02-26 10:32:12 +0100 | LainExperiments | (~LainExper@user/LainExperiments) LainExperiments |
| 2025-02-26 10:31:10 +0100 | LainExperiments5 | (~LainExper@user/LainExperiments) (Ping timeout: 240 seconds) |
| 2025-02-26 10:29:53 +0100 | rvalue | (~rvalue@user/rvalue) (Ping timeout: 248 seconds) |
| 2025-02-26 10:29:23 +0100 | merijn | (~merijn@77.242.116.146) (Ping timeout: 244 seconds) |
| 2025-02-26 10:29:13 +0100 | alfiee | (~alfiee@user/alfiee) alfiee |
| 2025-02-26 10:26:52 +0100 | Smiles | (uid551636@id-551636.lymington.irccloud.com) Smiles |
| 2025-02-26 10:26:40 +0100 | bionade24 | (~quassel@2a03:4000:33:45b::1) bionade24 |
| 2025-02-26 10:26:19 +0100 | bionade24 | (~quassel@2a03:4000:33:45b::1) (Read error: Connection reset by peer) |
| 2025-02-26 10:25:30 +0100 | <tomsmeding> | ah, and the GHC wiki calls any N.M.1 a major release, and any N.M.{2,3,...} a minor release! https://gitlab.haskell.org/ghc/ghc/-/wikis/GHC-status#1-release-practices |
| 2025-02-26 10:24:20 +0100 | GdeVolpiano | (~GdeVolpia@user/GdeVolpiano) GdeVolpiano |
| 2025-02-26 10:22:46 +0100 | GdeVolpiano | (~GdeVolpia@user/GdeVolpiano) (Quit: WeeChat 4.4.3) |
| 2025-02-26 10:20:42 +0100 | <tomsmeding> | (but it's not specified, just implied) |
| 2025-02-26 10:20:32 +0100 | <tomsmeding> | Stackage seems to use the same terminology as HLS ( https://github.com/commercialhaskell/stackage#frequently-asked-questions ) |
| 2025-02-26 10:19:04 +0100 | <tomsmeding> | the HLS GHC version support page ( https://haskell-language-server.readthedocs.io/en/latest/support/ghc-version-support.html ) seems to use "minor" for "1" and "major" for "9.12", but it's a little bit unclear |
| 2025-02-26 10:18:39 +0100 | <tomsmeding> | the GHC user guide ( https://downloads.haskell.org/ghc/latest/docs/users_guide/intro.html#ghc-version-numbering-policy ) seems to call the "1" the "patchlevel number", and uses the word "major release" for any abstract version x.y.z |
| 2025-02-26 10:17:47 +0100 | <tomsmeding> | How are the components of a GHC version called? E.g. for 9.12.1, how do I call the "9", the "12" and the "1"? |
| 2025-02-26 10:11:09 +0100 | chele | (~chele@user/chele) chele |