Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
blueberry87
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
1.
▲
Horrible answers to "What is a type?"
(blueberrywren.dev)
1 points
by
blueberry87
10mo ago
|
0 comments
2.
▲
Opinion Piece: On Zig
(blueberrywren.dev)
18 points
by
blueberry87
11mo ago
|
4 comments
3.
▲
Crafting a dependent typechecker, part 1
(blueberrywren.dev)
7 points
by
blueberry87
1y ago
|
0 comments
4.
▲
De Bruijn notation, and why it's useful
(blueberrywren.dev)
141 points
by
blueberry87
1y ago
|
44 comments
5.
▲
by
blueberry87
2y ago
i mean, then we get into defining multi-paradigm :P does it have objects that could, theoretically, be used in a java-like object oriented system? yes! does anybody do that? not really! it's far more functional than any other paradigm,
6.
▲
by
blueberry87
2y ago
this is wrong! ocaml is a functional programming language with side effects.
7.
▲
by
blueberry87
2y ago
annoyingly go can't have proper sum types, as the requirement for a default value for everything doesn't make any sense for sum types
8.
▲
by
blueberry87
3y ago
that's not how compile time works buddy
9.
▲
by
blueberry87
3y ago
You lose a very large amount of expressive power if you don't. Any formalisation of the reals requires at least 3 levels, if I remember correctly.
10.
▲
by
blueberry87
3y ago
What are your other options? A type-based proof system implies dependent types, implies universe levels if you want it to be consistent.
11.
▲
by
blueberry87
3y ago
Trying to compare a switch statement to proper pattern matching is like comparing a rock to a rocket.
12.
▲
by
blueberry87
3y ago
Also agda: https://plfa.github.io/
13.
▲
by
blueberry87
3y ago
What's your workflow for adding a new feature to something? In OCaml, with it's "high-tech language features like algebraic data types and ultra-strict typing", my entire workflow is: - Modify the types to add the new t
14.
▲
by
blueberry87
3y ago
Yeah, in any modern language with pattern matching stuff like this is absolutely the compiler's job, and can be done pretty well[1] - of course, there are plenty of legacy languages that don't have pattern matching, but seeing as
15.
▲
by
blueberry87
3y ago
+1 for "Brady_story".
16.
▲
by
blueberry87
3y ago
The point of this website isn't to mock software that has bugs - it's to show pitfalls that have been fallen into before, and could be fallen into again. If popular languages have encountered them in the past, and fixed them, why