Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
pbiggar
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
35 ms
·
421.
▲
by
pbiggar
6y ago
> When you're searching for product-market fit, you do the simplest, easiest thing. If you lack a good SDK for your cloud provider, the simplest, easiest thing is often a terrible architectural choice.
422.
▲
by
pbiggar
6y ago
I thought this was a joke, but nope: https://www.golakehavasu.com/london-bridge
423.
▲
by
pbiggar
6y ago
Thanks for mentioning us. The core idea of Dark is "can we take away steps and so reduce accidental complexity", which is very much in line with OP's point that we're stuck in an old way of writing software. I think the
424.
▲
by
pbiggar
6y ago
Thanks, appreciate it!
425.
▲
by
pbiggar
6y ago
Missing Airware - $112M raised. ( https://techcrunch.com/2018/09/14/airware-shuts-down/ )
426.
▲
by
pbiggar
6y ago
This is exactly what we do for Dark: https://github.com/darklang/dark/tree/main/scripts Not only that, but each script automatically runs itself in our docker container so it's fully repeatable. The
427.
▲
by
pbiggar
6y ago
Yes, the languages use immutable values so I understand the semantics. I agree that's quite nice, however updating nested values is very painful.
428.
▲
by
pbiggar
6y ago
To clarify, the thing I want is to make it nice and simple to create a new record with a nested field updated. It's easy to read a.b.c.d, but updating that field painful: let a = {a with b = { a.b with c = { a.b.c with d = 5 } }
429.
▲
by
pbiggar
6y ago
True, and so there might be a need for something like: e = e.lbl <- value (I didn't reuse the '=' because two '=' like that looks weird. The main thing I want to address is that a.b.c.d is so much work t
430.
▲
by
pbiggar
6y ago
My goal isn't to look _exactly_ like C++/etc, but rather to have a fairly natural duality between read and write. You can read with: a.b.c.d but a write is: let a = {a with b = { a.b with c = { a.b.c with d = 5 } }
431.
▲
by
pbiggar
6y ago
The syntax to update records doesn't seem particularly nice: e{lbl = val} Though this has been a part of haskell for a while it seems: > Note: e{lbl = val} is the syntax of a standard H98 record update FSharp, OCaml and Elm
432.
▲
by
pbiggar
6y ago
Firm agreement about the goals! Over at Dark ( https://darklang.com ), we've been referring to the space adjacent to Low/No-code as "Just code", to indicate that there's only code there and nothing else. W
433.
▲
by
pbiggar
6y ago
I'm very sympathetic to the problem. I'm working on Dark ( https://darklang.com ) which is a functional language, explicitly because we believe that functional languages are easier to learn, understand and provide great
434.
▲
by
pbiggar
6y ago
Hey Dan, didn't mean to violate the rules. To be clear, my comment was intended to be about his argument and it's lack of rigour. Also, his bio links his twitter, so I thought that made it within bounds. But yeah, that was a bit
435.
▲
by
pbiggar
6y ago
If you're going to try to be contrarian, at least do the research to do it well. You think you're being clever but you're showing no understanding of the positions you're trying to make fun of. As a result, you come acro
436.
▲
by
pbiggar
6y ago
I work on Dark ( https://darklang.com ), which uses a similar concept about holes to Hazel. I've looked at Hazel but amn't totally familiar, so take this answer in that context. In the first case, the hole has a type. I
437.
▲
by
pbiggar
6y ago
I'm not aware of any, sorry. You can look at the dark repo to see how we do it though: https://github.com/darklang/dark
438.
▲
by
pbiggar
6y ago
I've thought about it a few times, I'm so far from that ecosystem that I know nothing about it at all
439.
▲
by
pbiggar
6y ago
What a great writeup, thank you! I think I followed all that . Two things leap out at me: - I can see arenas for a compiler, but I'm not so sure for an interpreter. While most of the memory allocated in Dark will be done within a singl
440.
▲
by
pbiggar
6y ago
> Please don’t. This is probably one of the biggest mistakes I see in people coming from languages with garbage collection to languages like Rust or C++. They attempt to use smart pointers as a replacement for garbage collection. Thanks
441.
▲
by
pbiggar
6y ago
Both are systems programming languages (OCaml describes itself as such). The rewrite in Rust thing, for darklang at least, comes from the 50th time we've had to do something bad and ugly to fit into what is supported by OCaml.
442.
▲
by
pbiggar
6y ago
Thanks! How does the Arena help you with pattern matching? I'd be very interested.
443.
▲
by
pbiggar
6y ago
Yeah, it's really unfortunate. Dune and Esy are moving things forward, but you sorta have to know the ecosystem quite well to figure that out.
444.
▲
Thoughts on Rust vs. OCaml
(blog.darklang.com)
84 points
by
pbiggar
6y ago
|
45 comments
445.
▲
by
pbiggar
6y ago
Thanks for the correction! I actually confused my facts here - it's tipping I was thinking of that comes directly from slavery. Employer-paid health care just _continues_ because of racism, as opposed to being created by it.
446.
▲
by
pbiggar
6y ago
Once you agree a safety net is a net positive, then it comes down to implementation. In this case, the employer is the parent's employer. Which means that the people who can take the risk to create startups is limited to "people w
447.
▲
by
pbiggar
6y ago
Startups are in the US because of a long chain of decisions and network effects that ultimately come from US military spending in the 60s. > I quit my job and thanks to the insurance changes in the US a few years ago So you're sayin
448.
▲
by
pbiggar
6y ago
I recently had a bug that wouldn't have happened if I'd had these in place: https://dev.to/darklang/a-fun-bug-55cl . I added similar checks (and kube-score and polaris seem like good tools - I might try adding
449.
▲
by
pbiggar
6y ago
This sounds great! We actually discussed doing this at the very start of CircleCI (we had a partnership with an exception handling service, but we never executed on it). Coincidentally, my current company, Dark ( https://darklang.
450.
▲
by
pbiggar
6y ago
This is really cool! About a decade ago I did research on sorting and searching, which was the same type of work going on here ( https://github.com/pbiggar/sorting-branches-caching ). I found it was extremely difficult t
More ›