6 ms·
In the context of the original comment, aren't the performance characteristics of .NET pretty similar to the JVM (though I have no experience with the former)?
by zucker42 6y ago
In the context of the original comment, aren't the performance characteristics of .NET pretty similar to the JVM (though I have no experience with the former)? I don't see big reasons why someone who likes C# would hate Kotlin. F# is pretty different from the available JVM languages though.
- mehrdadn 6y agoThe startup time of .NET is nothing like JVM's in my experience.
- wott 6y agoA .Net terminal "hello world" takes a good 2 or 3 seconds on my computer. Yay... :-/
- bosswipe 6y agoI would say that Scala on the JVM is comparable to F#.
- HappyDoge 6y agoOnly to an untrained eye. F# is a firmly rooted in ML language family history, only making concessions where necessary due to the fact it's running on the CLR. Scala is a random walk of language design space, with different ideas either working or ending up complete trainwrecks, and the fact it's missing this clean ML core makes it a painful language to pick up coming in from F# (or in fact most other statically typed FP languages).
- deleted 6y ago[deleted]
- smabie 6y agoI mean, considering that Scala has a much more powerful type system than F# and you can actually implement FP concepts like monads, functors, etc makes it arguably more FP than F#. While I haven't used F# much, as a professional OCaml and Scala dev, Scala is hands down the more powerful language. OCaml isn't bad, but it leaves a lot to be desired. A little offtopic, but if OCaml got rid of its module system, added type classes, polymorphic functions, higher-kinded types, multi-core support and removed objects (not that it matters that much), it would be my dream language. Basically, I want Haskell without the dogma. Though, I guess that's what unsafePerformIO provides!
- siwatanejo 6y agoWhy do you say you cannot implement monads and functors in F#? sorry but this is bullshit
- smabie 6y agoF# doesn't support higher-kinded types.
- siwatanejo 6y agoThat doesn't make functors and monads impossible to implement.
- smabie 6y agoOf course not, but it means that there is no type that abstracts upon all of them. For example, in Haskell, you can >>= and >> just about everything and it'll work. In OCaml (and I assume F#), you have to import the right kind of >>= and >>. This is quite burdensome and creates a lot of repetitive and nasty code. The lack of polymorphism in ML languages is such a bummer.