Viewing profile — lptk
lptk
HN member- Joined
- Sat, Apr 21, 2018, 12:44 PM UTC
- HN karma
- 25
- Public activity
- 24 items
- HN profile
- View on Hacker News ↗
About lptk
No profile information was provided.
Recent public activity
-
comment
Comment #41908403
Genuine question, as I'm not up to date with C#'s recent developments: can C# do this? if e is ... Lit(value) and Map.find_opt(value) is Some(result) then Some(result) ... where th…
-
comment
Comment #41908364
It's currently badly outdated. There's one specifically for the UCS at https://ucs.mlscript.dev/
-
comment
Comment #41901614
PS: there's another point being made on Reddit about cond's right-shift problem: https://www.reddit.com/r/ProgrammingLanguages/comments/1g127...
-
comment
Comment #41901602
Also check out my other answer here: https://news.ycombinator.com/item?id=41901573
-
comment
Comment #41901573
Just check out the paper's Motivaton section (2). In ML you can't write something like this: if e is ... Lit(value) and Map.find_opt(value) is Some(result) then Some(result) ... wh…
-
comment
Comment #41900278
As mentioned in a response to a sibling comment, we plan to support `or`, which should address the problem you mention. (If not, would you have an example of what you mean?) > I wo…
-
comment
Comment #41900262
We definitely want to get into that! Unfortunately it's not completely straightforward. A simple desugaring doesn't work due to our support for intermediate bindings and computatio…
-
comment
Comment #31795842
Here the `Allocate` effect is just a syntactically-lightweight way of doing dependency injection, right? Similar to a Haskell type class. I don't see why you'd need to make it an a…
-
comment
Comment #31795627
That's obviously nonsense. Java, one pair of parens: int x = 1; int y = x + 1; System.out.println(y); Clojure, six pairs of brackets: (let [x 1 y (+ x 1)] ((. (. System out) printl…
-
comment
Comment #31795105
Your idea of what FP means is completely nonstandard. For the record, there is not one accepted definition, but we can get close by saying that FP languages are those based on lamb…
-
comment
Comment #26557081
They almost certainly run into these issues, but like most of the community, they probably think the cost is well worth bearing, given the advantages the language gives you. Once y…
-
comment
Comment #26556746
Worth noting that the presenter of this talk has done a complete 180 on subtyping as he's now using subtyping and variance in the core of his flagship library ZIO. He realized it w…
-
comment
Comment #24961424
(I'm not the person you were asking, but:) The power of Haskell's type classes comes from two things: * Implicit composition of instances: you can write `show [True, False]`, which…
-
comment
Comment #24961315
> but parallelism is also a base fact of many problem domains, where you have multiple agents (up to and including humans) collaborating and interacting simultaneously. I don't thi…
-
comment
Comment #23967165
> the functional perl approach here I also find confusing so there is no attempt to distill the essence of what's going on Sorry to hear that! I guess it depends on your preference…
-
comment
Comment #23966963
> It would be difficult to just stumble on a system like Simple-sub without that guidance Actually, I'm not sure it would be that hard (Simple-sub author here). If you look at the …
-
comment
Comment #23966684
Hi, author here. Just wanted to say that you should read the paper rather than the blog post, as the paper is more recent. It's in open access (and CC-BY license) here: https://inf…
-
comment
Comment #23655118
I think it's safe to say that the inspiration for Java lambda almost certainly did not come from the "FP zeitgeist" you're describing, but simply from other JVM languages like Scal…
-
comment
Comment #17515346
> building for papers and PhDs rather than real customers > the community takes a good hard look at itself to see what it can improve This has already been happening for a while. F…
-
comment
Comment #16957273
If by "all constructions wiht HKTs", you mean what can be done with HKTs in Haskell, then I'd say yes. It is well-known that ML modules provide a very advanced level of expressiven…
-
comment
Comment #16891641
> The first example disproved ionforce's claim that default values cannot be constructed dynamically. But I don't think that is what they meant. I think they meant something along …
-
comment
Comment #16891554
What does this have to do with the original assertion that "one of Odersky's motives in creating Scala was bringing the power of Haskell into the JVM world"? AFAIK, Odersky doesn't…
-
comment
Comment #16891520
> Haskell's key innovation over ML was HKTs In fact, ML modules have had higher-kinded types [1] since before Haskell even existed. I guess Haskell's main innovation in this domain…
-
comment
Comment #16891476
Your example of nested functions with default arguments does not correspond to what derived implicits do. As a result of implicit resolution, an expression with an arbitrary number…