Home freenode/#haskell: Logs Calendar

Logs: freenode/#haskell

←Prev  Next→
Page 1 .. 459 460 461 462 463 464 465 466 467 468 469 .. 5022
— 502,152 events total
2020-10-06 11:01:03 × GyroW quits (~GyroW@unaffiliated/gyrow) (Ping timeout: 260 seconds)
2020-10-06 11:02:08 → tito_04 joins (~taurux@net-93-146-7-28.cust.vodafonedsl.it)
2020-10-06 11:02:13 × taurux quits (~taurux@net-93-146-7-28.cust.vodafonedsl.it) (Ping timeout: 260 seconds)
2020-10-06 11:02:31 → LKoen joins (~LKoen@81.255.219.130)
2020-10-06 11:05:43 × todda7 quits (~torstein@athedsl-217541.home.otenet.gr) (Ping timeout: 260 seconds)
2020-10-06 11:06:16 → olligobber joins (olligobber@gateway/vpn/privateinternetaccess/olligobber)
2020-10-06 11:06:27 × GyroW_ quits (~GyroW@unaffiliated/gyrow) (Quit: Someone ate my pie)
2020-10-06 11:06:44 → GyroW joins (~GyroW@ptr-48ujrfd1ztq5fjywfw3.18120a2.ip6.access.telenet.be)
2020-10-06 11:06:44 × GyroW quits (~GyroW@ptr-48ujrfd1ztq5fjywfw3.18120a2.ip6.access.telenet.be) (Changing host)
2020-10-06 11:06:44 → GyroW joins (~GyroW@unaffiliated/gyrow)
2020-10-06 11:07:40 → zargoertzel joins (~zar@fw1.ciirc.cvut.cz)
2020-10-06 11:08:27 × mpereira quits (~mpereira@2a02:810d:f40:d96:1c35:7f2e:59ff:953) (Ping timeout: 240 seconds)
2020-10-06 11:10:28 × zariuq quits (~zar@fw4.ciirc.cvut.cz) (Ping timeout: 260 seconds)
2020-10-06 11:11:13 → seanvert joins (~user@177.84.244.242)
2020-10-06 11:11:38 → Gurkenglas joins (~Gurkengla@unaffiliated/gurkenglas)
2020-10-06 11:17:52 × cpressey quits (~cpressey@88.144.95.3) (Quit: WeeChat 1.9.1)
2020-10-06 11:18:58 hackage reanimate-svg 0.12.2.0 - SVG file loader and serializer https://hackage.haskell.org/package/reanimate-svg-0.12.2.0 (DavidHimmelstrup)
2020-10-06 11:19:40 → todda7 joins (~torstein@athedsl-217541.home.otenet.gr)
2020-10-06 11:21:01 → heatsink joins (~heatsink@107-136-5-69.lightspeed.sntcca.sbcglobal.net)
2020-10-06 11:21:21 → shailangsa joins (~shailangs@host165-120-169-97.range165-120.btcentralplus.com)
2020-10-06 11:21:28 hackage uniqueness-periods-vector-examples 0.9.0.0 - Usage examples for the uniqueness-periods-vector series of packages https://hackage.haskell.org/package/uniqueness-periods-vector-examples-0.9.0.0 (OleksandrZhabenko)
2020-10-06 11:21:35 × takuan quits (~takuan@178-116-218-225.access.telenet.be) (Read error: Connection reset by peer)
2020-10-06 11:24:12 → takuan joins (~takuan@178-116-218-225.access.telenet.be)
2020-10-06 11:24:53 → mpereira joins (~mpereira@2a02:810d:f40:d96:1c35:7f2e:59ff:953)
2020-10-06 11:25:28 × heatsink quits (~heatsink@107-136-5-69.lightspeed.sntcca.sbcglobal.net) (Ping timeout: 246 seconds)
2020-10-06 11:28:56 × frdg quits (60e94035@pool-96-233-64-53.bstnma.fios.verizon.net) (Remote host closed the connection)
2020-10-06 11:30:25 × snakemasterflex quits (~snakemast@213.100.206.23) (Ping timeout: 256 seconds)
2020-10-06 11:32:09 × oisdk quits (~oisdk@2001:bb6:3329:d100:4f8:7c72:bd88:6c6a) (Quit: oisdk)
2020-10-06 11:32:39 → yoeljacobsen joins (~yoel.jaco@5.28.167.89)
2020-10-06 11:34:51 → Guest_91 joins (bcfa50ec@188.250.80.236)
2020-10-06 11:36:07 ← Guest_91 parts (bcfa50ec@188.250.80.236) ()
2020-10-06 11:37:13 → hekkaidekapus{ joins (~tchouri@gateway/tor-sasl/hekkaidekapus)
2020-10-06 11:38:43 × hekkaidekapus_ quits (~tchouri@gateway/tor-sasl/hekkaidekapus) (Ping timeout: 240 seconds)
2020-10-06 11:39:18 → bahamas joins (~lucian@unaffiliated/bahamas)
2020-10-06 11:40:24 → Habib joins (~Habib@194.35.233.138)
2020-10-06 11:42:07 × todda7 quits (~torstein@athedsl-217541.home.otenet.gr) (Ping timeout: 240 seconds)
2020-10-06 11:42:25 × gekh quits (~gkh@thor.kevinhill.nl) (Quit: Goodbye!)
2020-10-06 11:43:20 → gekh joins (~gkh@thor.kevinhill.nl)
2020-10-06 11:43:47 → cosimone joins (~cosimone@2001:b07:ae5:db26:b248:7aff:feea:34b6)
2020-10-06 11:44:37 × fendor_ quits (~fendor@e237-037.eduroam.tuwien.ac.at) (Ping timeout: 264 seconds)
2020-10-06 11:46:10 × pacak quits (~pacak@bb116-14-220-91.singnet.com.sg) (Read error: Connection reset by peer)
2020-10-06 11:46:55 → fendor joins (~fendor@e237-037.eduroam.tuwien.ac.at)
2020-10-06 11:47:59 → da39a3ee5e6b4b0d joins (~textual@n11211935170.netvigator.com)
2020-10-06 11:49:25 × cosimone quits (~cosimone@2001:b07:ae5:db26:b248:7aff:feea:34b6) (Ping timeout: 240 seconds)
2020-10-06 11:49:40 × alx741 quits (~alx741@186.178.110.22) (Ping timeout: 260 seconds)
2020-10-06 11:52:35 → todda7 joins (~torstein@athedsl-217541.home.otenet.gr)
2020-10-06 11:55:22 → pacak joins (~pacak@bb116-14-220-91.singnet.com.sg)
2020-10-06 11:55:38 → zariuq joins (~zar@fw1.ciirc.cvut.cz)
2020-10-06 11:57:20 <quazimod1> so I was playing around with ocaml and found some things quite disappointing
2020-10-06 11:57:26 → frdg joins (60e94035@pool-96-233-64-53.bstnma.fios.verizon.net)
2020-10-06 11:57:53 <quazimod1> it took forever to spin up a working code base... and i still have no idea how to split nested submodules into their own files... doesn't appear to be possible
2020-10-06 11:58:05 × zargoertzel quits (~zar@fw1.ciirc.cvut.cz) (Ping timeout: 240 seconds)
2020-10-06 11:58:39 <quazimod1> anyway I'm writing quantitative finance code and am evaluating languages, when reading about ocaml's strictness vs haskell's laziness I found that GHC has a 'strict' option
2020-10-06 11:59:04 <quazimod1> i had no idea that this existed, is it commonly used, or compatible with existing libraries
2020-10-06 12:00:01 × Implant1 quits (~Implant@178.162.212.214) ()
2020-10-06 12:00:04 → Wuzzy joins (~Wuzzy@p5790e6f5.dip0.t-ipconnect.de)
2020-10-06 12:00:05 × bahamas quits (~lucian@unaffiliated/bahamas) (Ping timeout: 240 seconds)
2020-10-06 12:00:18 <dminuoso> quazimod1: Not very commonly used.
2020-10-06 12:00:31 <quazimod1> i cant wrap my head around it being a drop in option that 'just works'
2020-10-06 12:01:00 <dminuoso> Well, ultimately I dont think lazyness is a real issue. Overall lazy by default seems far more preferrable to strict by default.
2020-10-06 12:01:16 <quazimod1> dminuoso: far more preferrable?
2020-10-06 12:01:19 <dminuoso> Yes.
2020-10-06 12:01:28 hackage futhark 0.17.3 - An optimising compiler for a functional, array-oriented language. https://hackage.haskell.org/package/futhark-0.17.3 (TroelsHenriksen)
2020-10-06 12:01:28 <dminuoso> Code becomes far more modular
2020-10-06 12:01:43 <dminuoso> And the downsides are just matters of having to debug a space leak in the odd case.
2020-10-06 12:02:06 <dminuoso> But equivalently, if you're too strict, you can have performance issues as well.
2020-10-06 12:02:07 <quazimod1> i'm not experience enough with haskell to really understand 'code becomes far more modular'
2020-10-06 12:02:22 <quazimod1> i'll take your word for it though
2020-10-06 12:02:24 → snakemasterflex joins (~snakemast@213.100.206.23)
2020-10-06 12:03:05 <dminuoso> Don't take my word for it.
2020-10-06 12:03:47 × Stanley00 quits (~stanley00@unaffiliated/stanley00) (Remote host closed the connection)
2020-10-06 12:03:55 → alx741 joins (~alx741@186.178.110.191)
2020-10-06 12:04:53 <frdg> I am having trouble understanding this error. Can I accumulate values with only Foldable and Monoid instances? https://dpaste.org/ekMY
2020-10-06 12:05:19 <dminuoso> quazimod1: The topic has been discussed at ends on reddit or stackoverflow, so Ill just redirect you there.
2020-10-06 12:05:21 <dminuoso> https://www.reddit.com/r/haskell/comments/5xge0v/today_i_used_laziness_for/deia53t/?utm_source=reddit&utm_medium=web2x&context=3
2020-10-06 12:06:17 <quazimod1> ah nice
2020-10-06 12:09:38 → machinedgod joins (~machinedg@24.105.81.50)
2020-10-06 12:10:35 <dminuoso> frdg: True -> x <> acc
2020-10-06 12:10:54 <dminuoso> frdg: This is where the accident happens. Consider what the type of `x` is
2020-10-06 12:12:05 <dminuoso> % :t foldr
2020-10-06 12:12:05 <yahb> dminuoso: Foldable t => (a -> b -> b) -> b -> t a -> b
2020-10-06 12:12:12 <frdg> x :: a. So I need a function that is `a -> t a -> t a`
2020-10-06 12:12:25 <dminuoso> Sure, but that's not possible with t being just Foldable
2020-10-06 12:12:56 <frdg> that is what I feared
2020-10-06 12:13:35 → cosimone joins (~cosimone@2001:b07:ae5:db26:b248:7aff:feea:34b6)
2020-10-06 12:13:36 <dminuoso> Im pondering about this currently, I feel there might be something close
2020-10-06 12:14:06 × mpereira quits (~mpereira@2a02:810d:f40:d96:1c35:7f2e:59ff:953) (Read error: Connection reset by peer)
2020-10-06 12:14:17 × yoeljacobsen quits (~yoel.jaco@5.28.167.89) (Ping timeout: 265 seconds)
2020-10-06 12:14:31 <dminuoso> From the looks of it, Set is the best you have.
2020-10-06 12:14:35 → mpereira joins (~mpereira@2a02:810d:f40:d96:693e:4333:5b77:9e8f)
2020-10-06 12:15:14 <dminuoso> Ah I found it
2020-10-06 12:15:17 <dminuoso> So what you're asking for is
2020-10-06 12:15:57 <L29Ah> % minimum(1,2)
2020-10-06 12:15:58 <dminuoso> intersect :: (Unfoldable t, Foldable t, Eq a) => t a -> t a -> t a
2020-10-06 12:15:58 <yahb> L29Ah: 2
2020-10-06 12:16:06 <dminuoso> Where Unfoldable is from the package `unfoldable`
2020-10-06 12:16:28 <dminuoso> Then, the most efficient way would be to roundtrip through a set, do the intersection, and then unfold it back
2020-10-06 12:16:45 <frdg> ok thanks Ill try this.
2020-10-06 12:16:47 <ski> @where whyfp
2020-10-06 12:16:47 <lambdabot> "Why Functional Programming Matters" by John Hughes in 1984 at <http://www.cse.chalmers.se/~rjmh/Papers/whyfp.html>
←Prev  Next→
Page 1 .. 459 460 461 462 463 464 465 466 467 468 469 .. 5022

All times are in UTC.