Newest at the top
| 2026-01-26 00:44:23 +0100 | trickard_ | (~trickard@cpe-86-98-47-163.wireline.com.au) |
| 2026-01-26 00:44:10 +0100 | trickard_ | (~trickard@cpe-86-98-47-163.wireline.com.au) (Read error: Connection reset by peer) |
| 2026-01-26 00:42:48 +0100 | ljdarj | (~Thunderbi@user/ljdarj) (Ping timeout: 256 seconds) |
| 2026-01-26 00:36:42 +0100 | weary-traveler | (~user@user/user363627) user363627 |
| 2026-01-26 00:28:35 +0100 | Pozyomka | (~pyon@user/pyon) pyon |
| 2026-01-26 00:20:27 +0100 | bitdex | (~bitdex@gateway/tor-sasl/bitdex) bitdex |
| 2026-01-26 00:20:07 +0100 | bitdex | (~bitdex@gateway/tor-sasl/bitdex) (Remote host closed the connection) |
| 2026-01-26 00:14:35 +0100 | Fijxu | (~Fijxu@user/fijxu) fijxu |
| 2026-01-26 00:13:16 +0100 | Fijxu | (~Fijxu@user/fijxu) (Quit: XD!!) |
| 2026-01-26 00:11:35 +0100 | trickard_ | (~trickard@cpe-86-98-47-163.wireline.com.au) |
| 2026-01-26 00:11:22 +0100 | trickard | (~trickard@cpe-86-98-47-163.wireline.com.au) (Read error: Connection reset by peer) |
| 2026-01-26 00:08:29 +0100 | sp1ff` | (~user@2601:1c2:4701:900::32d4) (Remote host closed the connection) |
| 2026-01-26 00:04:34 +0100 | mulk | (~mulk@p5b1128da.dip0.t-ipconnect.de) mulk |
| 2026-01-26 00:02:34 +0100 | mulk | (~mulk@pd95143a6.dip0.t-ipconnect.de) (Ping timeout: 256 seconds) |
| 2026-01-25 23:59:10 +0100 | Square3 | (~Square@user/square) (Ping timeout: 255 seconds) |
| 2026-01-25 23:58:41 +0100 | <EvanR> | oop, everything's an object. FP, everything's a function! |
| 2026-01-25 23:44:26 +0100 | <tomsmeding> | our functions either recurse or traverse |
| 2026-01-25 23:44:23 +0100 | <monochrom> | https://www.slideshare.net/slideshow/fp-patterns-buildstufflt/41936137#13 >:) |
| 2026-01-25 23:43:32 +0100 | <monochrom> | But we are worse than calling everything "recursion" aren't we? We call everything "function". |
| 2026-01-25 23:42:36 +0100 | <monochrom> | Oh yeah all of us should just say "least fixed point" and be done with it! |
| 2026-01-25 23:42:05 +0100 | <monochrom> | (It had to go through a delay. I also had a "part (b)" in which the students had to show what would go wrong in Haskell if there were no delay.) |
| 2026-01-25 23:41:59 +0100 | <tomsmeding> | monochrom: conversely, functional programmers call everything recursion that we have more precise words for :) |
| 2026-01-25 23:41:08 +0100 | <monochrom> | I once posed a homework question that defined infinite streams of Bool to represent timing diagrams of digital circuits, then had students code up a flip flop using a feedback loop. (One more "plain English" word for recursion!) |
| 2026-01-25 23:38:36 +0100 | <monochrom> | People invent all sorts of "plain/simple English" words to avoid saying "recursion". :) |
| 2026-01-25 23:35:27 +0100 | <geekosaur> | plus most other events scheduled other events for later, since it was a population simulator so it was simulating various life events |
| 2026-01-25 23:34:01 +0100 | <EvanR> | in arrow FRP you wouldn't use recursion but ArrowLoop |
| 2026-01-25 23:34:00 +0100 | takuan | (~takuan@d8D86B9E9.access.telenet.be) (Ping timeout: 244 seconds) |
| 2026-01-25 23:33:49 +0100 | bitdex | (~bitdex@gateway/tor-sasl/bitdex) bitdex |
| 2026-01-25 23:33:25 +0100 | <EvanR> | e.g. interpreting recursion doesn't necessarily need anything cyclic |
| 2026-01-25 23:33:08 +0100 | <EvanR> | but whether that counts as some sort of cycle, might depend on your concept of the underlying implementation |
| 2026-01-25 23:33:07 +0100 | <geekosaur> | I wasn't using FRP but a PSQ for a simulation, and one of the events was a status report that triggered every so often in simulated time and rescheduled itself for later |
| 2026-01-25 23:32:35 +0100 | <EvanR> | early versions of FRP exploited recursive definitions (why you might be thinking of as cycles?) to implement some sort of state |
| 2026-01-25 23:31:14 +0100 | <tomsmeding> | as I said, I dunno, maybe this is nonsense :) |
| 2026-01-25 23:31:05 +0100 | <tomsmeding> | the update to the time triggers an update to the time again, after a delay? |
| 2026-01-25 23:30:45 +0100 | <mjacob> | tomsmeding: Where is the cycle in this example? |
| 2026-01-25 23:22:50 +0100 | machinedgod | (~machinedg@d75-159-126-101.abhsia.telus.net) (Ping timeout: 245 seconds) |
| 2026-01-25 23:21:16 +0100 | oats | (~oats@user/oats) oats |
| 2026-01-25 23:21:01 +0100 | oats | (~oats@user/oats) (Read error: Connection reset by peer) |
| 2026-01-25 23:15:35 +0100 | <tomsmeding> | a clock? (disclaimer: have never used FRP) |
| 2026-01-25 23:14:00 +0100 | <mjacob> | What are possible applications of cycles in functional reactive programming? I know that many frameworks forbid it unless there is a delay in each cycle. But it is hard to me to think of an example where cycles are useful (with or without delay). |
| 2026-01-25 23:11:28 +0100 | mjacob | (~mjacob@adrastea.uberspace.de) mjacob |
| 2026-01-25 23:07:58 +0100 | <monochrom> | But beware that it is only delivered to the main thread. |
| 2026-01-25 23:07:16 +0100 | <monochrom> | :) |
| 2026-01-25 22:58:30 +0100 | <tomsmeding> | ah no I'm stupid, ignore, it's AsyncException in base |
| 2026-01-25 22:57:57 +0100 | <tomsmeding> | do I really have to reach into ghc-internal to get the UserInterrupt exception, for detecting if someone ^C'd me? |
| 2026-01-25 22:55:30 +0100 | DetourNetworkUK | (DetourNetw@user/DetourNetworkUK) (Ping timeout: 252 seconds) |
| 2026-01-25 22:53:08 +0100 | target_i | (~target_i@user/target-i/x-6023099) (Quit: leaving) |
| 2026-01-25 22:52:45 +0100 | jmcantrell_ | (~weechat@user/jmcantrell) (Ping timeout: 252 seconds) |
| 2026-01-25 22:42:41 +0100 | pavonia | (~user@user/siracusa) siracusa |
| 2026-01-25 22:41:26 +0100 | oskarw | (~user@user/oskarw) (Remote host closed the connection) |