Newest at the top
| 2025-01-31 23:00:47 +0100 | Googulator | (~Googulato@2a01-036d-0106-418c-6daf-e703-6cee-d20f.pool6.digikabel.hu) |
| 2025-01-31 23:00:10 +0100 | <ski> | (iirc Jean-Yves Girard's "Proofs and Types" (translated and with appendices by Paul Taylor,Yves Lafont) in 1989,1990,2003 at <https://www.paultaylor.eu/stable/prot.pdf> talks a little about that topic) |
| 2025-01-31 23:00:09 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds) |
| 2025-01-31 22:55:24 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-01-31 22:47:27 +0100 | <dolio> | Because mathematicians foolishly ignore things like performance. |
| 2025-01-31 22:46:57 +0100 | <dolio> | The math says that a Church encoding is a valid implementation of an algebraic data type, even though it has different performance characteristics than usually expected. |
| 2025-01-31 22:45:49 +0100 | <dolio> | My point is, the math doesn't tell you how to implement it. It tells you what operations need to be implemented, and some equations they follow. |
| 2025-01-31 22:44:44 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 260 seconds) |
| 2025-01-31 22:43:53 +0100 | takuan | (~takuan@d8D86B601.access.telenet.be) (Remote host closed the connection) |
| 2025-01-31 22:42:38 +0100 | CoolMa7 | (~CoolMa7@ip5f5b8957.dynamic.kabel-deutschland.de) (Quit: Textual IRC Client: www.textualapp.com) |
| 2025-01-31 22:42:06 +0100 | ezzieyguywuf | (~Unknown@user/ezzieyguywuf) (Quit: Lost terminal) |
| 2025-01-31 22:42:02 +0100 | <EvanR> | pure result >>= rest of the code |
| 2025-01-31 22:41:51 +0100 | <EvanR> | mentally note the side effects of whatever library action, then replace with the result >>= the rest of the code |
| 2025-01-31 22:41:26 +0100 | <EvanR> | more like a free monad |
| 2025-01-31 22:41:19 +0100 | <EvanR> | not state tokens |
| 2025-01-31 22:37:34 +0100 | Smiles | (uid551636@id-551636.lymington.irccloud.com) (Quit: Connection closed for inactivity) |
| 2025-01-31 22:35:07 +0100 | hgolden | (~hgolden@2603:8000:9d00:3ed1:6ff3:8389:b901:6363) hgolden |
| 2025-01-31 22:34:47 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-01-31 22:33:48 +0100 | <ski> | ("your spaces are dropped, all of them" -- well, not on C64. but it does tokenize the keywords to single bytes) |
| 2025-01-31 22:33:41 +0100 | <dolio> | Or, the particular implementation of algebraic data types you actually get. |
| 2025-01-31 22:33:04 +0100 | <monochrom> | :( |
| 2025-01-31 22:32:33 +0100 | <dolio> | Who says using algebraic data types is mathematical? |
| 2025-01-31 22:32:12 +0100 | <monochrom> | perhaps s/functions/emulating continuations by functions/ |
| 2025-01-31 22:31:40 +0100 | <monochrom> | Maybe a good analogy is: free monads perform better if you use the CPS version. Now go one step further and use GHC-native continuations instead of functions. |
| 2025-01-31 22:29:52 +0100 | hgolden | (~hgolden@2603:8000:9d00:3ed1:6ff3:8389:b901:6363) (Remote host closed the connection) |
| 2025-01-31 22:29:37 +0100 | sp1ff | (~user@c-67-160-173-55.hsd1.wa.comcast.net) sp1ff |
| 2025-01-31 22:29:30 +0100 | <monochrom> | Algebraic effects perform better if you use shift-reset (for handlers) instead of being mathemtical and using algebraic data types. |
| 2025-01-31 22:29:21 +0100 | <dminuoso> | Every time I try and learn about them, I get confused by gibberish lisp |
| 2025-01-31 22:28:26 +0100 | <dminuoso> | Oh, delimited continuations - never understood what these are about. |
| 2025-01-31 22:28:02 +0100 | <dminuoso> | My programs have not crashed.. yet. |
| 2025-01-31 22:28:01 +0100 | <monochrom> | You may also like: GHC shift-reset. >:) |
| 2025-01-31 22:27:33 +0100 | <dminuoso> | But honestly, every time I look at those discussions or commit logs, I dont know why I said what I said... or did what I did. |
| 2025-01-31 22:27:10 +0100 | <dminuoso> | Oh Im not sure I understand IO. I have unpacked IO before, unsafeCoerce#'ed state tokens, argued where and why unsafeDupableInlineIO should be used.. |
| 2025-01-31 22:26:00 +0100 | <EvanR> | that even works in IO, if you can visualize the IO effect happening |
| 2025-01-31 22:25:33 +0100 | <EvanR> | yes! |
| 2025-01-31 22:25:16 +0100 | <dminuoso> | Personally I often visualize evaluation in Haskell as a big fat arrow that moves around in my code and just inlines/replaces. :-) |
| 2025-01-31 22:24:47 +0100 | <EvanR> | formatted |
| 2025-01-31 22:24:46 +0100 | euouae | (~euouae@user/euouae) () |
| 2025-01-31 22:24:45 +0100 | <EvanR> | store the code in such a shorthand form for execution, then if you go to edit it, it is elaborated and auto formatting |
| 2025-01-31 22:24:42 +0100 | <euouae> | I'll be back... with more questions. Got to go, thanks all |
| 2025-01-31 22:24:20 +0100 | <EvanR> | the language for lambda MOO did something like that |
| 2025-01-31 22:23:57 +0100 | <EvanR> | monochrom, nice optimization |
| 2025-01-31 22:23:56 +0100 | <dminuoso> | "Most BASIC implementations I have seen" - sounds like you are a BASIC connoisseur |
| 2025-01-31 22:23:52 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds) |
| 2025-01-31 22:23:28 +0100 | <byte> | meow |
| 2025-01-31 22:23:11 +0100 | <monochrom> | For example "FOR" becomes one byte. And if you enter "10 FOR I = 1 TO 100" your spaces are dropped, all of them. |
| 2025-01-31 22:23:03 +0100 | alfiee | (~alfiee@user/alfiee) (Ping timeout: 252 seconds) |
| 2025-01-31 22:22:27 +0100 | byte | (~mu@user/byte) byte |
| 2025-01-31 22:22:19 +0100 | Tuplanolla | (~Tuplanoll@91-159-69-59.elisa-laajakaista.fi) Tuplanolla |
| 2025-01-31 22:21:47 +0100 | <monochrom> | Most BASIC implementations I have seen make at least a minimal attempt to store code more compact than actual text strings. |