Home freenode/#haskell: Logs Calendar

Logs: freenode/#haskell

←Prev  Next→
Page 1 .. 545 546 547 548 549 550 551 552 553 554 555 .. 5022
502,152 events total
2020-10-09 21:00:02 × ButterflyOfFire quits (~Butterfly@185.163.110.116) ()
2020-10-09 21:00:24 × knupfer quits (~Thunderbi@200116b82c4c7d00cc4c311526e4b875.dip.versatel-1u1.de) (Quit: knupfer)
2020-10-09 21:00:32 knupfer joins (~Thunderbi@200116b82c4c7d00ac20288f9f283cdb.dip.versatel-1u1.de)
2020-10-09 21:01:06 × _vaibhavingale_ quits (~Adium@203.188.228.27) (Quit: Leaving.)
2020-10-09 21:01:19 snakemas1 joins (~snakemast@213.100.206.23)
2020-10-09 21:01:55 × elliott_ quits (~elliott@pool-108-51-141-12.washdc.fios.verizon.net) (Client Quit)
2020-10-09 21:02:53 nbloomf joins (~nbloomf@2600:1700:83e0:1f40:ac:b25b:cce8:9c5a)
2020-10-09 21:02:54 conal joins (~conal@64.71.133.70)
2020-10-09 21:02:54 <ghoulguy> Good dog
2020-10-09 21:03:56 × heatsink quits (~heatsink@107-136-5-69.lightspeed.sntcca.sbcglobal.net) (Ping timeout: 256 seconds)
2020-10-09 21:06:07 × nbloomf quits (~nbloomf@2600:1700:83e0:1f40:ac:b25b:cce8:9c5a) (Client Quit)
2020-10-09 21:06:57 × snakemas1 quits (~snakemast@213.100.206.23) (Ping timeout: 265 seconds)
2020-10-09 21:07:03 elliott_ joins (~elliott@pool-108-51-141-12.washdc.fios.verizon.net)
2020-10-09 21:08:31 × Zetagon quits (~leo@c151-177-52-233.bredband.comhem.se) (Remote host closed the connection)
2020-10-09 21:09:14 heatsink joins (~heatsink@107-136-5-69.lightspeed.sntcca.sbcglobal.net)
2020-10-09 21:09:18 timotayj joins (~timotayj@188.214.15.156)
2020-10-09 21:10:28 snakemas1 joins (~snakemast@213.100.206.23)
2020-10-09 21:10:34 × chaosmasttter quits (~chaosmast@p200300c4a70b4001c004325a2a510724.dip0.t-ipconnect.de) (Quit: WeeChat 2.9)
2020-10-09 21:10:42 × vicfred quits (~vicfred@unaffiliated/vicfred) (Quit: Leaving)
2020-10-09 21:11:22 nbloomf joins (~nbloomf@2600:1700:83e0:1f40:ac:b25b:cce8:9c5a)
2020-10-09 21:11:33 × heatsink quits (~heatsink@107-136-5-69.lightspeed.sntcca.sbcglobal.net) (Remote host closed the connection)
2020-10-09 21:11:49 heatsink joins (~heatsink@107-136-5-69.lightspeed.sntcca.sbcglobal.net)
2020-10-09 21:11:58 vicfred joins (~vicfred@unaffiliated/vicfred)
2020-10-09 21:12:51 <Cheery> wee.. these guys haven't solved what to do if the text is longer than what the program is meant to process.
2020-10-09 21:15:10 timotayj is now known as TJChem
2020-10-09 21:15:45 GyroW_ joins (~GyroW@d54c03e98.access.telenet.be)
2020-10-09 21:15:45 × GyroW_ quits (~GyroW@d54c03e98.access.telenet.be) (Changing host)
2020-10-09 21:15:45 GyroW_ joins (~GyroW@unaffiliated/gyrow)
2020-10-09 21:15:48 <Cheery> it's interesting though.. should the summarizer run twice on the content? Or should there be sentiment analysis that identifies non-important parts of the text first?
2020-10-09 21:16:25 × GyroW quits (~GyroW@unaffiliated/gyrow) (Ping timeout: 240 seconds)
2020-10-09 21:16:25 × vicfred quits (~vicfred@unaffiliated/vicfred) (Client Quit)
2020-10-09 21:17:13 × snakemas1 quits (~snakemast@213.100.206.23) (Ping timeout: 260 seconds)
2020-10-09 21:17:22 × takuan quits (~takuan@178-116-218-225.access.telenet.be) (Ping timeout: 258 seconds)
2020-10-09 21:18:08 × ryansmccoy quits (~ryansmcco@193.37.254.27) (Ping timeout: 258 seconds)
2020-10-09 21:18:31 ryansmccoy joins (~ryansmcco@193.37.254.27)
2020-10-09 21:19:51 thir joins (~thir@p200300f27f02580060eb7dde324e54c8.dip0.t-ipconnect.de)
2020-10-09 21:21:25 × mirrorbird quits (~psutcliff@m83-185-82-223.cust.tele2.se) (Quit: Leaving)
2020-10-09 21:23:43 snakemas1 joins (~snakemast@213.100.206.23)
2020-10-09 21:24:04 vicfred joins (~vicfred@unaffiliated/vicfred)
2020-10-09 21:24:24 fantasticsid joins (~user@2601:641:8000:4f00:58ae:cf75:1df1:eeff)
2020-10-09 21:25:23 × ryansmccoy quits (~ryansmcco@193.37.254.27) (Ping timeout: 260 seconds)
2020-10-09 21:26:21 ryansmccoy joins (~ryansmcco@193.37.254.27)
2020-10-09 21:27:45 × wroathe_ quits (~wroathe@c-68-54-25-135.hsd1.mn.comcast.net) (Ping timeout: 240 seconds)
2020-10-09 21:28:17 × thir quits (~thir@p200300f27f02580060eb7dde324e54c8.dip0.t-ipconnect.de) (Ping timeout: 260 seconds)
2020-10-09 21:28:58 × Jesin quits (~Jesin@pool-72-66-101-18.washdc.fios.verizon.net) (Quit: Leaving)
2020-10-09 21:29:33 <nshepperd> first summarize the first half, then summarize the second half, then summarize the two summaries
2020-10-09 21:30:31 × nbloomf quits (~nbloomf@2600:1700:83e0:1f40:ac:b25b:cce8:9c5a) (Quit: My MacBook has gone to sleep. ZZZzzz…)
2020-10-09 21:30:59 × machinedgod quits (~machinedg@24.105.81.50) (Remote host closed the connection)
2020-10-09 21:31:09 <monochrom> That doesn't bode well when each half establishes context for the other half.
2020-10-09 21:31:59 machinedgod joins (~machinedg@24.105.81.50)
2020-10-09 21:32:11 <monochrom> Or rather, e.g., the last sentence of the first half is useful when summarizing the second half.
2020-10-09 21:32:58 × snakemas1 quits (~snakemast@213.100.206.23) (Ping timeout: 260 seconds)
2020-10-09 21:33:22 <monochrom> And so I propose a sliding window scheme. For every i, summarize from byte i to byte i+N, where N is the input length limit of the summerizer algorithm.
2020-10-09 21:33:31 <sshine> I'm writing a Megaparsec parser for an AST made recursive with Data.Fix. before Data.Fix I would write e.g.: InfixL (Mul <$ symbol "*") -- with Mul :: Expr -> Expr -> Expr. but with Data.Fix, I need to replace 'Mul' with '\a b -> Fix (Mul a b)'. is there a convenient way to overcome that?
2020-10-09 21:33:56 <monochrom> Then perhaps summarize the concatenation of those outputs. And perhaps one more level above that, as necessary.
2020-10-09 21:34:43 <ghoulguy> sshine: When you're using Fix it's not uncommon to then name the constructors wrapped in fix
2020-10-09 21:34:53 <ghoulguy> mul x y = Fix (Mul x y)
2020-10-09 21:35:02 brandly joins (~brandly@c-73-68-15-46.hsd1.ma.comcast.net)
2020-10-09 21:35:24 <sshine> ghoulguy, as part of the module where the AST lives in?
2020-10-09 21:35:40 <sshine> that certainly makes my tests look nicer.
2020-10-09 21:35:59 <ghoulguy> or even with pattern synonyms to do that
2020-10-09 21:36:08 <ghoulguy> yeah, close to the AST definition makes sense
2020-10-09 21:36:09 <monochrom> It certain makes good sense for a module to provide convenience for its user and use cases.
2020-10-09 21:36:23 Sososasa joins (~textual@2601:643:8000:a570:9513:b921:a468:618c)
2020-10-09 21:36:29 <sshine> I sense TH opportunity, and I sense that maybe recursion-schemes did something here.
2020-10-09 21:36:34 <ski> sshine : you could define pattern synonyms
2020-10-09 21:36:45 <monochrom> Now, if you also find that when writing pattern matching, "f (Fix (Mul a b)) = ..." is very tiresome...
2020-10-09 21:36:57 <ski> what monochrom was about to say
2020-10-09 21:37:09 <monochrom> then what ski said. Pattern synonyms solves both problems. Two birds in one stone.
2020-10-09 21:37:10 <ghoulguy> You're going to find using Fix is tiresome in general
2020-10-09 21:37:13 <sshine> I don't actually pattern match much on the Fix thingy because of all the convenience combinators.
2020-10-09 21:37:29 <sshine> ghoulguy, oh, thanks for the heads up.
2020-10-09 21:37:51 <monochrom> And as well, it's desired to define the pattern synonyms in the AST module and export them, so users benefit.
2020-10-09 21:37:52 <sshine> I was wanting to save lines doing passes. :)
2020-10-09 21:38:11 <monochrom> s/desired/desirable/
2020-10-09 21:38:48 <monochrom> pattern synonym = smart constructors and deconstructors
2020-10-09 21:39:00 <monochrom> well, bidirection pattern synonym
2020-10-09 21:39:02 <sshine> right.
2020-10-09 21:39:18 <sshine> I've tried pattern synonyms. seems neat.
2020-10-09 21:40:47 × elliott_ quits (~elliott@pool-108-51-141-12.washdc.fios.verizon.net) (Ping timeout: 265 seconds)
2020-10-09 21:42:53 × ryansmccoy quits (~ryansmcco@193.37.254.27) (Ping timeout: 260 seconds)
2020-10-09 21:42:53 × ystael quits (~ystael@209.6.50.55) (Ping timeout: 260 seconds)
2020-10-09 21:43:10 ryansmccoy joins (~ryansmcco@193.37.254.27)
2020-10-09 21:43:57 hackage wolf 0.3.48 - Amazon Simple Workflow Service Wrapper. https://hackage.haskell.org/package/wolf-0.3.48 (markfine)
2020-10-09 21:44:44 × cpape` quits (~user@static.180.18.203.116.clients.your-server.de) (Quit: ERC (IRC client for Emacs 26.3))
2020-10-09 21:44:52 <sshine> ghoulguy, so you wouldn't pick data-fix/recursion-schemes for an AST at some point in the near future?
2020-10-09 21:45:07 × fantasticsid quits (~user@2601:641:8000:4f00:58ae:cf75:1df1:eeff) (Ping timeout: 240 seconds)
2020-10-09 21:46:09 cpape joins (~user@static.180.18.203.116.clients.your-server.de)
2020-10-09 21:46:57 × knupfer quits (~Thunderbi@200116b82c4c7d00ac20288f9f283cdb.dip.versatel-1u1.de) (Ping timeout: 260 seconds)
2020-10-09 21:47:39 tambow44 joins (~tambow44@163.47.239.202)
2020-10-09 21:47:44 <monochrom> I am not ghoulguy, but I found recursion schemes ineffective in cost-benefit. For all its extra Fix annoyance, it saves you, what, from writing an easy-to-write catamorphism?
2020-10-09 21:48:03 tambow44 parts (~tambow44@163.47.239.202) ()
2020-10-09 21:48:06 <dsal> I kind of wish I knew what recursion schemes was.
2020-10-09 21:48:44 × nshepperd quits (~nshepperd@pool-96-239-61-124.nycmny.fios.verizon.net) (Quit: bye)
2020-10-09 21:48:54 <monochrom> Instead, I find "data types a la carte" much more worthwhile, if you plan an extensible AST and interpreter etc.
2020-10-09 21:49:26 <ski> i still would like to be able to turn `splitPrefix' into a pattern synonym ..
2020-10-09 21:49:54 <dminuoso> dsal: The motivation is actually quite simple.
2020-10-09 21:50:07 <dminuoso> % foldr (+) 0 [1..10] -- dsal
2020-10-09 21:50:07 <yahb> dminuoso: 55
2020-10-09 21:50:09 <monochrom> There are even many free monads that I would rather hand-write than use the free monad library. Unless I want that library's feature of making things efficient.

All times are in UTC.