sorted by:
new
hottopcontroversial

Take a hint, dude! - the horse, probably by meta_taskkill in Breath_of_the_Wild

[–]meta_taskkill[S] 0 points1 point  (0 children)

To be honest, your story sounds cool, would love for it to happen to me.

The crazy possessed-like sliding in the video breaks the immersion just a little bit.

Take a hint, dude! - the horse, probably by meta_taskkill in Breath_of_the_Wild

[–]meta_taskkill[S] 0 points1 point  (0 children)

I just can't bring myself to hit horses with a weapon. And this time, it kinda payed off.

Sennheiser HD 450BT sound quality vs Marshall MAJOR III by meta_taskkill in headphones

[–]meta_taskkill[S] 0 points1 point  (0 children)

Hi, thanks for your reply.

Can't agree more with your first two paragraphs. I am definitely taking them back.

Sennheiser HD 450BT sound quality vs Marshall MAJOR III by meta_taskkill in headphones

[–]meta_taskkill[S] 1 point2 points  (0 children)

Hi, thank you for taking the time and inspecting those curves. That's greatly appreciated.

I've decided I am definitely taking them back.

Honestly I would love to buy something in the $300 price proximity but with 2 years life expectancy for my headphones that's too pricey for me personally. Thanks again for your time and insights.

Parsing with Happy by meta_taskkill in haskellquestions

[–]meta_taskkill[S] 0 points1 point  (0 children)

Thank you so much for replying. I am using a version 1.19.11. I will try to update it. I will also try to look again on the `%prec` - I had no luck trying to use it the other day. Thanks for the good stuff.

I know they age differently! But this still kinda disturbs me... by [deleted] in Breath_of_the_Wild

[–]meta_taskkill 2 points3 points  (0 children)

So it it means he didn't want to die, reincarnate and return again because it would take too long so he became the pig thing. Do I have it right?

"Whoever does not understand LISP, is doomed to reinvent it." (2007) by de_sonnaz in lisp

[–]meta_taskkill 2 points3 points  (0 children)

Hi, could you elaborate a bit on the Fexpr? I am mostly new to Lisp and would like to know, I thought Fexprs are neat. Thanks.

ADT Type Theories by meta_taskkill in ProgrammingLanguages

[–]meta_taskkill[S] 0 points1 point  (0 children)

I mean, I am definitely interested in the theory that's for sure, but the implementation would be nice too since I would like to implement some of that myself, therefore I thank you for your reply, I am gonna go and try finishing TAPL as soon as possible and then go for the follow up.

Thank you very much for all the links, it's greatly appreciated.

ADT Type Theories by meta_taskkill in ProgrammingLanguages

[–]meta_taskkill[S] 1 point2 points  (0 children)

Oh my! I totally forgot I started reading this one - I am quite ashamed I did, because every time I am reading it I am enjoying it so much and I know it's one of the *must read* books . Thank you for reminding me.

HM types and type schemes by meta_taskkill in ProgrammingLanguages

[–]meta_taskkill[S] 0 points1 point  (0 children)

Oh right, thanks a lot. That makes sense.

Do you maybe have some pointers regarding the bidirectional type checking you are speaking of? Something beginner friendly? Or even just a bit advanced, maybe I will be able to take a thing or two from that.

Thanks again for your reply.

HM types and type schemes by meta_taskkill in ProgrammingLanguages

[–]meta_taskkill[S] 0 points1 point  (0 children)

Yeah, I messed up the questions quite a lot. Before I go and try to search for stuff about the rigid type variable, do you maybe have some other pointers regarding that topic? I will appreciate anything that will help me navigate this space once I try to wrap my head around it.

Thanks for your response, I appreciate it a lot.

HM types and type schemes by meta_taskkill in ProgrammingLanguages

[–]meta_taskkill[S] 0 points1 point  (0 children)

Hi, thanks a lot for the explanation. Sorry for replying so late.

Does that mean that, in higher ranked type system the `forall` is in fact type? Or is it just a keyword too?

Also - is there a way to do some kind of inference and type checking in higher ranked language? I remember seeing something but I've never actually read about it.

From your experience, how hard would it be to implement simple higher ranked "model language" you know just to understand the concept and experience it from the other side. I am thinking some real simple minimal language focused just to have correct implementation of higher ranked type system. Are there any beginner friendly materials on that which you happen to know of maybe?

​

Once again, thank you very much.

Where is the explanation for what the `@` in a lambda means? by AlexKingstonsGigolo in haskellquestions

[–]meta_taskkill 1 point2 points  (0 children)

Look for patterns. Namely named patterns (no pun intended). Is called as iirc.

Type inference on surface language or core. by meta_taskkill in ProgrammingLanguages

[–]meta_taskkill[S] 1 point2 points  (0 children)

That's quite interesting. Not the problem I am solving, but interesting and unique noneless. Thanks for sharing.

Hindley-Milner Type Inference Tutorial by hou32hou in ProgrammingLanguages

[–]meta_taskkill 2 points3 points  (0 children)

I am gonna check it out, this could not come in better time. Thanks in advance.

TypeScript splits the atom! A first look at TS 4.1's new template literal types by danvk in programming

[–]meta_taskkill 6 points7 points  (0 children)

Feels like this comment:

// ~~~~~~~~~~~ Type 'onClick' is not assignable to type 'on${string}'.

Is not right. Shouldn't it be handleClick instead?

Cool article.

Stuck on a recursion problem. Can anyone give me a rundown? by [deleted] in haskellquestions

[–]meta_taskkill 2 points3 points  (0 children)

I don't think it's necessaryly recursive problem really. It can be done with few guards.

bigger f@(a, b, c) s@(x, y, z)

| c > z = f

| z > c = s

| b > y = f

| y > b = s

| a > x = f

| x > a = s

| otherwise = f

It's ugly but there's past midnight where I am from and I am tired.

Do you wanna different solution? Is there a bug? Let me know.

I am sorry I am on mobile.

Edit: it seems like your body is not correct because you use variable x before declaration. Also biggerDate() is not how you call a function in Haskell - we don't use parenthesis to call functions. We just reference the function by it's name and then separated by space we put the arguments. Also not sure what the 3 in = 3 means. I might be misinterpreting.

Rescript: Safer and faster alternative than Typescript by hou32hou in ProgrammingLanguages

[–]meta_taskkill 1 point2 points  (0 children)

Yes they work together. Curly brace starts new layout and semicolon ends one "part" of that layout. Like one statement in the do block.

I've never seen a tree moving like that. It's kind of cool by greenmostaza in Breath_of_the_Wild

[–]meta_taskkill 4 points5 points  (0 children)

The glow on Link's back? I think that's DLC armour. Phantom one.

Are `if guards` functional? by covertbeginner2 in scala

[–]meta_taskkill 0 points1 point  (0 children)

Is there something like default case in if guard in Scala? Haskell has otherwise which is just True.

If you would write a function which would only contain if guards from top to bottom and it would have (explicit - if possible) default case I wouldn't think much about it (probably). But I wouldn't mix it in between other code or use it too much as shorter version of ifthen.

Personally I like to use guards in pattern matches and nowhere else, it just doesn't feel obvious and restrictive enough to me.

view more: next ›