Posts by kwarrtz@mathstodon.xyz
 (DIR) Post #2755834 by kwarrtz@mathstodon.xyz
       2019-01-08T02:34:15Z
       
       0 likes, 0 repeats
       
       @somarasu @uranther The problem imo is that the hijacking is more than just cultural. The wild swings in value due to cryptocurrency becoming a hotspot for speculative investment has made it impractical as an actual currency. That isn’t a fundamental flaw with the idea of cryptocurrency, just part of what I think is handicapping its effectiveness at the moment.
       
 (DIR) Post #3086577 by kwarrtz@mathstodon.xyz
       2019-01-18T01:56:39Z
       
       0 likes, 0 repeats
       
       @JordiGH If you think of arithmetic as operations on the real line, where addition corresponds to translation and multiplication corresponds to scaling, then multiplication by a negative number is a scale and a flip, so two flips cancel out. This is still pretty abstract, but it is at least geometric/visual and (I think) fairly intuitive
       
 (DIR) Post #3124534 by kwarrtz@mathstodon.xyz
       2019-01-19T02:21:17Z
       
       1 likes, 1 repeats
       
       @amiloradovsky @veer66 Rust doesn't have higher order typeclasses, so it has no applicative functors in the Haskell sense. What are you referring to here?
       
 (DIR) Post #3125192 by kwarrtz@mathstodon.xyz
       2019-01-19T02:49:05Z
       
       1 likes, 0 repeats
       
       @amiloradovsky @veer66 Ah, so it looks like the Rust snippet there is using some sort of unstable or experimental features to get higher kinded types. As for Andrew's original criticism, I find the abstraction very useful and convenient, but I imagine it's largely a personal preference/style thing. In many cases, I'll point out, abstraction also improves efficiency and safety, but I'm not going to make a claim as to whether that's the case here specifically.
       
 (DIR) Post #3125298 by kwarrtz@mathstodon.xyz
       2019-01-19T02:51:54Z
       
       1 likes, 0 repeats
       
       @amiloradovsky @veer66 As for Haskell's syntax, I know there's some debate around this. Binary combinators are very useful and concise, but there's a question about whether to use symbols or words in infix position. I think symbols are easier to scan and parse once you're used to them, but I certainly understand the accessibility complaint.
       
 (DIR) Post #3126369 by kwarrtz@mathstodon.xyz
       2019-01-19T03:32:54Z
       
       1 likes, 0 repeats
       
       @TheAspiringHacker @veer66 This gets a little confusing because people often consider lifetimes in Rust to have their own (atomic) kind. I don’t know if this is sound from a type theoretical point of view though
       
 (DIR) Post #3132722 by kwarrtz@mathstodon.xyz
       2019-01-19T08:11:30Z
       
       1 likes, 1 repeats
       
       @veer66 @charlag +1 for LYAH as an introductory resource. I never even finished it but it’s good for getting off the ground. Just hang in there. It’s a lot of new concepts, but once  you get used to the syntax and some of the idiosyncrasies things will start to click. Functional programming is a very different mindset, but I think it’s a worthwhile for all programmers to understand the patterns, even if they only use imperative languages.
       
 (DIR) Post #3278851 by kwarrtz@mathstodon.xyz
       2019-01-23T05:19:58Z
       
       0 likes, 1 repeats
       
       @amiloradovsky Makntainability, perhaps. Rust is still a somewhat immature language, so a few years from now the entire ecosystem may have changed and made your tools difficult to support. Certainly not trying to dissuade you though. I love Rust, and the ecosystem is becoming more stable and mature every day.
       
 (DIR) Post #9fySz0z3uKk5A6coT2 by kwarrtz@mathstodon.xyz
       2019-02-18T23:16:00Z
       
       0 likes, 0 repeats
       
       @kai @abs My problem with Go is that it’s never felt very consistent. With really well done languages like Haskell or Rust, there’s a clear set of objectives for what the language should accomplish and be goof at, and every decision can more or less be traced as an attempt to work towards those goals. A lot of Go, on the other hand, just feels like “whatever Rob Pike wanted”
       
 (DIR) Post #9ghRVTEfEwFoBZbGPA by kwarrtz@mathstodon.xyz
       2019-03-11T08:01:47Z
       
       0 likes, 0 repeats
       
       @Silverrpent Yikes, I’m sorry :( Did the project involve 3D modeling?
       
 (DIR) Post #9hHSw7uuGSqjfmVgwa by kwarrtz@mathstodon.xyz
       2019-03-29T20:26:04Z
       
       0 likes, 0 repeats
       
       Has anyone ever interacted with ATS before?http://www.ats-lang.org@tfb or @amiloradovsky maybe?
       
 (DIR) Post #9hNRdGoqC5qXndcBQe by kwarrtz@mathstodon.xyz
       2019-04-01T22:20:47Z
       
       0 likes, 0 repeats
       
       @grainloom Have you heard of ATS? I just ran into it recently but it sounds like you might find it interesting. ats-lang.org
       
 (DIR) Post #9hNfJLCbaOyIxd7bP6 by kwarrtz@mathstodon.xyz
       2019-04-02T00:54:00Z
       
       0 likes, 0 repeats
       
       @grainloom ATS probably would be jumping in the deep end if you've never done much dependent programming before 😄 And actually, of those three languages, I'd say Idris is the easiest to learn despite its experimental status. All of the existing literature on Agda and Coq (that I'm aware of) is kind of impenetrable. The Idris tutorial isn't as complete but is more accessible imo. The language itself is also arguably easier to learn, especially if you know Haskell.
       
 (DIR) Post #9hNo7IBDtdLjhRnxAW by kwarrtz@mathstodon.xyz
       2019-04-02T02:32:42Z
       
       0 likes, 0 repeats
       
       @grainloom That’s fair. Agda is certainly more mature. I am curious though, what kind of limitations are you running into? As an aside, if you haven’t already, I’d suggest looking into Lean. It’s also on the more “experimental” side compared to Coq, but I personally have found it much more natural to learn and use.
       
 (DIR) Post #9hNqMfncYvOZCpE8Bs by kwarrtz@mathstodon.xyz
       2019-04-02T02:57:55Z
       
       0 likes, 0 repeats
       
       @grainloom If you’re trying to do programming with safety guarantees courtesy of depending typing, then absolutely Idris or Agda are the way to go, but if you’re doing straight theorem proving then their capabilities are kind of limited to compared to Coq or Lean.
       
 (DIR) Post #9hNs6neBofFaowNGEq by kwarrtz@mathstodon.xyz
       2019-04-02T03:17:26Z
       
       0 likes, 0 repeats
       
       @grainloom Yeah, formalization is harddddddd, as I’ve had driven home to me recently too
       
 (DIR) Post #9haqA19DoS3kemc8jg by kwarrtz@mathstodon.xyz
       2019-04-08T06:29:35Z
       
       2 likes, 2 repeats
       
       @kurisu Plan 9 is dead and we have killed it
       
 (DIR) Post #9icAWAdgmpzz2gR6VU by kwarrtz@mathstodon.xyz
       2019-05-08T22:41:29Z
       
       0 likes, 0 repeats
       
       @sir You can always just ask the people in the thread to untag you. That should stop notifications even if Mute Conversation isn’t working for whatever reason
       
 (DIR) Post #9tug89fJCDqDDrgrVA by kwarrtz@mathstodon.xyz
       2020-04-10T21:33:55Z
       
       0 likes, 0 repeats
       
       @vriska Friend shaped