Newest at the top
| 2024-05-01 05:59:56 +0200 | bitdex | (~bitdex@gateway/tor-sasl/bitdex) (Remote host closed the connection) |
| 2024-05-01 05:52:53 +0200 | bitdex | (~bitdex@gateway/tor-sasl/bitdex) |
| 2024-05-01 05:41:11 +0200 | cashew | (~cashewsta@65.17.175.150) (Quit: Leaving...) |
| 2024-05-01 05:40:34 +0200 | philopsos | (~caecilius@user/philopsos) |
| 2024-05-01 05:07:14 +0200 | aforemny | (~aforemny@2001:9e8:6cea:d00:aab5:d1b:ca3e:df36) |
| 2024-05-01 05:06:05 +0200 | aforemny_ | (~aforemny@i59F516CA.versanet.de) (Ping timeout: 240 seconds) |
| 2024-05-01 05:05:58 +0200 | madeleine-sydney | (~madeleine@c-76-155-235-153.hsd1.co.comcast.net) |
| 2024-05-01 05:02:59 +0200 | tri | (~tri@ool-18bc2e74.dyn.optonline.net) (Ping timeout: 264 seconds) |
| 2024-05-01 04:58:09 +0200 | tri | (~tri@ool-18bc2e74.dyn.optonline.net) |
| 2024-05-01 04:52:51 +0200 | gues54302 | (~username@3.184.70.115.static.exetel.com.au) (Ping timeout: 260 seconds) |
| 2024-05-01 04:52:49 +0200 | ddellacosta | (~ddellacos@ool-44c73d29.dyn.optonline.net) |
| 2024-05-01 04:51:55 +0200 | demon-cat | (~demon-cat@dund-15-b2-v4wan-169642-cust1347.vm6.cable.virginm.net) |
| 2024-05-01 04:51:31 +0200 | demon-cat | (~demon-cat@dund-15-b2-v4wan-169642-cust1347.vm6.cable.virginm.net) (Remote host closed the connection) |
| 2024-05-01 04:50:10 +0200 | Bynbo7 | (~Axman6@user/axman6) (Remote host closed the connection) |
| 2024-05-01 04:48:03 +0200 | waldo | (~waldo@user/waldo) (Quit: waldo) |
| 2024-05-01 04:45:22 +0200 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) (Ping timeout: 268 seconds) |
| 2024-05-01 04:45:19 +0200 | terrorjack | (~terrorjac@2a01:4f8:c17:87f8::) |
| 2024-05-01 04:43:24 +0200 | terrorjack | (~terrorjac@2a01:4f8:c17:87f8::) (Quit: The Lounge - https://thelounge.chat) |
| 2024-05-01 04:43:21 +0200 | gues54302 | (~username@3.184.70.115.static.exetel.com.au) |
| 2024-05-01 04:42:35 +0200 | Square3 | (~Square4@user/square) (Ping timeout: 268 seconds) |
| 2024-05-01 04:29:44 +0200 | td_ | (~td@i53870927.versanet.de) |
| 2024-05-01 04:27:50 +0200 | td_ | (~td@i53870902.versanet.de) (Ping timeout: 245 seconds) |
| 2024-05-01 04:21:27 +0200 | cashew | (~cashewsta@65.17.175.150) |
| 2024-05-01 04:17:49 +0200 | Axman4765 | Bynbo7 |
| 2024-05-01 04:17:42 +0200 | Axman4765 | (~Axman6@user/axman6) |
| 2024-05-01 04:13:50 +0200 | Katarushisu1 | (~Katarushi@finc-20-b2-v4wan-169598-cust1799.vm7.cable.virginm.net) |
| 2024-05-01 04:12:09 +0200 | <c_wraith> | no, I mean that if a problem like this is hard, there are just a *lot* of distinct subproblems. |
| 2024-05-01 04:11:54 +0200 | <talismanick> | It's probably be none-too-expensive to preface the interpreter with the reduction rules, so long as the free monad/binary decision tree is built and consumed incrementally, right? |
| 2024-05-01 04:11:39 +0200 | Katarushisu1 | (~Katarushi@finc-20-b2-v4wan-169598-cust1799.vm7.cable.virginm.net) (Read error: Connection reset by peer) |
| 2024-05-01 04:09:58 +0200 | <talismanick> | The reduction of a Boolean function is canonical (up to variable ordering), so maybe it's not a problem in this case... |
| 2024-05-01 04:08:09 +0200 | <talismanick> | c_wraith: the cost of bookkeeping is prohibitive for free monads in general, you mean? |
| 2024-05-01 04:05:28 +0200 | ski | only heard someone mention Soufflé the other week, recognized the mention of BDDBDDB, but hasn't looked at it |
| 2024-05-01 04:02:45 +0200 | <c_wraith> | Ah, not quite. Patricia tries have a fixed fanout of 2 |
| 2024-05-01 04:01:17 +0200 | <c_wraith> | Which... sounds sorta like Patricia Tries, actually. |
| 2024-05-01 04:01:01 +0200 | <c_wraith> | B-trees are already lexicographically ordered. I'm betting it's more like adjusting the number of bits in a node in order keep the fan-out within particular bounds. |
| 2024-05-01 03:59:41 +0200 | <talismanick> | found it: https://souffle-lang.github.io/pdf/pmam19.pdf |
| 2024-05-01 03:59:28 +0200 | <talismanick> | ski: I think Souffle now uses a concurrent B-tree/trie hybrid (lexicographically-ordered B-tree?) |
| 2024-05-01 03:50:54 +0200 | wroathe | (~wroathe@user/wroathe) (Ping timeout: 252 seconds) |
| 2024-05-01 03:49:59 +0200 | <ski> | (not clear how would apply something like that to BDDs, though) |
| 2024-05-01 03:49:07 +0200 | <ski> | (what i was thinking about was encoding the sharing in the type, or rather, in the decomposition process, making it mandatory, thereby making sure it will happen in the result as well) |
| 2024-05-01 03:47:32 +0200 | <ski> | there's also a problem that when traversing a structure with sharing, producing a new parallel structure, that would normally lose all sharing |
| 2024-05-01 03:46:30 +0200 | ski | . o O ( "BDD-Based Deductive Databasee" <https://bddbddb.sourceforge.net/> ; "Soufflé - A Datalog Synthesis Tool for Static Analysis" <https://souffle-lang.github.io> ) |
| 2024-05-01 03:43:11 +0200 | waleee | (~waleee@h-176-10-144-38.NA.cust.bahnhof.se) (Quit: WeeChat 4.1.2) |
| 2024-05-01 03:38:18 +0200 | <c_wraith> | well, no. The problem is sharing only happens when explicitly introduced, and doing that is going to require bookkeeping. And the memory cost of that bookkeeping is ridiculous. |
| 2024-05-01 03:36:16 +0200 | <talismanick> | Is the problem is that laziness memoizes and shares for you without asking, making every tree equivalent to a DAG but not the one you want? |
| 2024-05-01 03:32:04 +0200 | <talismanick> | kind of like SAT solving |
| 2024-05-01 03:31:46 +0200 | <talismanick> | https://en.wikipedia.org/wiki/Binary_decision_diagram |
| 2024-05-01 03:31:22 +0200 | <ski> | s/re/are/ |
| 2024-05-01 03:31:19 +0200 | ski | doesn't recall what those re |
| 2024-05-01 03:31:09 +0200 | <talismanick> | yeah |