Newest at the top
| 2026-02-24 10:40:27 +0100 | <tomsmeding> | a _complete lattice_ additionally requires suprema and infima of larger sets |
| 2026-02-24 10:40:10 +0100 | <tomsmeding> | and thus finite sets |
| 2026-02-24 10:40:07 +0100 | <tomsmeding> | according to the wikipedia definition that I'm currently reading, a plain "lattice" requires joins and meets of _two_ elements |
| 2026-02-24 10:40:06 +0100 | <dminuoso> | I see. |
| 2026-02-24 10:40:04 +0100 | <dminuoso> | Ohh wait. |
| 2026-02-24 10:39:46 +0100 | <dminuoso> | tomsmeding: Aren't all lattices bounded by their suprema? |
| 2026-02-24 10:39:16 +0100 | <tomsmeding> | well, a bounded lattice |
| 2026-02-24 10:38:55 +0100 | <tomsmeding> | perhaps? |
| 2026-02-24 10:38:47 +0100 | <dminuoso> | tomsmeding: Okay so what you're saying is that Bounded is just synonmous for Lattice? |
| 2026-02-24 10:38:17 +0100 | <tomsmeding> | dminuoso: all subset of a given set S are partially ordered by inclusion, and they have a unique minimum ({}) and maximum (S), but they are not totally ordered |
| 2026-02-24 10:37:38 +0100 | <tomsmeding> | (but then, it's probably "minimum", which would not have helped dminuoso) |
| 2026-02-24 10:37:27 +0100 | <tomsmeding> | perhaps "lower bound" is not the technically correct term here |
| 2026-02-24 10:37:15 +0100 | <tomsmeding> | sure, but even those need not have a total ordering |
| 2026-02-24 10:36:44 +0100 | <__monty__> | It's restricted to partial orders that have a single lower and upper bound. |
| 2026-02-24 10:36:43 +0100 | <tomsmeding> | dminuoso: yes, a lower bound :) https://en.wikipedia.org/wiki/Lattice_(order) |
| 2026-02-24 10:36:32 +0100 | <__monty__> | tomsmeding: But Bounded doesn't deal with just any partial order. |
| 2026-02-24 10:36:30 +0100 | <dminuoso> | Im not even sure what that would mean. |
| 2026-02-24 10:36:22 +0100 | <dminuoso> | tomsmeding: Is there a notion of `minimum` in a partially ordered set, then? |
| 2026-02-24 10:36:09 +0100 | sp1ff | (~user@c-24-20-218-28.hsd1.wa.comcast.net) sp1ff |
| 2026-02-24 10:35:55 +0100 | <humasect> | how to learn ? |
| 2026-02-24 10:35:54 +0100 | <tomsmeding> | partial orders are a thing |
| 2026-02-24 10:35:54 +0100 | <dminuoso> | Oh. |
| 2026-02-24 10:35:50 +0100 | <tomsmeding> | dminuoso: not every ordering is total |
| 2026-02-24 10:35:48 +0100 | <humasect> | perhaps look into its meaning, disassemble it to understanding |
| 2026-02-24 10:35:43 +0100 | <dminuoso> | It reads nonsensical to me. |
| 2026-02-24 10:35:32 +0100 | <dminuoso> | humasect: Yes, and its not much of an explanation. |
| 2026-02-24 10:35:24 +0100 | tomsmeding | should have thought of that |
| 2026-02-24 10:35:05 +0100 | <tomsmeding> | lol, dminuoso ^ |
| 2026-02-24 10:34:47 +0100 | <humasect> | it says right in the first sentence https://hackage-content.haskell.org/package/base-4.22.0.0/docs/Data-Bounded.html |
| 2026-02-24 10:33:53 +0100 | <tomsmeding> | but then you could argue that you should give that Ord instance anyway |
| 2026-02-24 10:33:40 +0100 | <tomsmeding> | perhaps it makes sense that an Enum has a first and a last value for enumeration, but while it has an ordering compatible with that Enum instance, that ordering makes no semantical sense and is hence not defined? |
| 2026-02-24 10:32:50 +0100 | Enrico63 | (~Enrico63@host-79-19-156-232.retail.telecomitalia.it) Enrico63 |
| 2026-02-24 10:32:19 +0100 | <dminuoso> | What does `minimum/maximum` even mean in the absence of an ordering? |
| 2026-02-24 10:31:58 +0100 | <dminuoso> | Curious, why is Ord not a superclass of Bounded? |
| 2026-02-24 10:31:27 +0100 | <yahb2> | minBound :: Bounded a => a |
| 2026-02-24 10:31:27 +0100 | <dminuoso> | % :t minBound |
| 2026-02-24 10:27:08 +0100 | sp1ff | (~user@2601:1c2:4701:7850::8cd) (Ping timeout: 268 seconds) |
| 2026-02-24 10:25:44 +0100 | Alex_delenda_est | (~al_test@178.34.163.162) |
| 2026-02-24 10:20:15 +0100 | Alex_test_ | (~al_test@178.34.163.162) (Ping timeout: 255 seconds) |
| 2026-02-24 10:18:24 +0100 | jreicher | (~joelr@user/jreicher) jreicher |
| 2026-02-24 10:17:33 +0100 | Alex_delenda_est | (~al_test@178.34.163.162) (Ping timeout: 255 seconds) |
| 2026-02-24 10:15:54 +0100 | jreicher | (~joelr@user/jreicher) (Quit: brb) |
| 2026-02-24 10:15:47 +0100 | Alex_test_ | (~al_test@178.34.163.162) |
| 2026-02-24 10:14:02 +0100 | AlexZenon | (~alzenon@178.34.163.162) |
| 2026-02-24 10:13:07 +0100 | Alex_delenda_est | (~al_test@178.34.163.162) |
| 2026-02-24 10:07:46 +0100 | emmanuelux | (~em@user/emmanuelux) (Quit: bye) |
| 2026-02-24 10:06:08 +0100 | lxsameer | (~lxsameer@Serene/lxsameer) lxsameer |
| 2026-02-24 09:52:36 +0100 | merijn | (~merijn@77.242.116.146) merijn |
| 2026-02-24 09:52:16 +0100 | srk | (~sorki@user/srk) srk |
| 2026-02-24 09:51:37 +0100 | emmanuelux | (~em@user/emmanuelux) emmanuelux |