frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Linux 7.3 Released

https://lwn.net/Articles/1101143/
73•cjd8•1h ago•21 comments

Rabbits were a medieval royal luxury in England until the Black Death

https://phys.org/news/2026-10-rabbits-medieval-royal-luxury-england.html
73•samizdis•1d ago•54 comments

Hybrid Reasoning Agents: LLM agents that think in latent space, act through text

https://arxiv.org/abs/2610.18861
378•allinonai•11h ago•182 comments

William Gibson and the trademarking of cyberspace

https://colo.to/cyberspace.html
175•Eric_Gullichsen•8h ago•56 comments

There's never been a better time to go into math (by: 3blue1brown) [video]

https://www.youtube.com/watch?v=LKrwhjOI8Nc
353•mdp2021•1d ago•413 comments

If you don't run your own LLM proxy, how do you know whats going on?

https://jrdsgl.com/if-you-dont-run-your-own-llm-proxy-how-the-fuck-do-you-even-know-whats-going-on/
150•amrrs•11h ago•94 comments

How to Train Your Robot

https://www.construction-physics.com/p/how-to-train-your-robot
12•crescit_eundo•3d ago•2 comments

Someone behind the software

https://karrisaarinen.com/posts/someone-behind-the-software/
434•tosh•16h ago•159 comments

Laptop Based on 6502 CPU

https://www.maddox.pro/?p=448
114•nanochess•3d ago•47 comments

Superlite: A Faster Alternatie to Superpowers

https://contextfirst.blog/superlite-hand-an-agent-a-spec/
84•iheatuchriswogu•6h ago•33 comments

Dogs seem to agree with humans that 'bouba' is round and 'kiki' is spiky

https://www.sciencealert.com/dogs-seem-to-agree-with-humans-that-bouba-is-round-and-kiki-is-spiky
222•gmays•1d ago•128 comments

Tmux and Claude Code: Sessions, Send-Keys, and the Ceiling

https://crystl.dev/guides/tmux-for-ai-agents/
11•ankitg12•2h ago•3 comments

Verisign .com Domain Name Registry Consumer Class Action

https://www.hbsslaw.com/cases/verisign-com-domain-name-registry-consumer-class-action
89•greyface-•3h ago•32 comments

RepRapMicron

https://github.com/VikOlliver/RepRapMicron/wiki
385•RobotToaster•18h ago•63 comments

Flatpak – An Insecurity Nightmare

https://oro.gay/posts/flatpak-an-insecurity-nightmare/
22•jannesan•3h ago•12 comments

Free Pascal compiler now supports dynamic packages

https://www.getlazarus.org/dynamic/
159•sysrpl•13h ago•38 comments

The DNS Museum

https://dns.museum
60•zdw•2d ago•8 comments

How Quickly Can the DoD Rebuild and Recast the Munitions Industrial Base?

https://www.csis.org/analysis/how-quickly-can-dod-rebuild-and-recast-munitions-industrial-base
56•gmays•8h ago•59 comments

Lant – The Forgotten Resource

https://sites.udel.edu/materialmatters/2018/04/11/lant-the-forgotten-resource/
3•kreyenborgi•3d ago•1 comments

Show HN: WhatsApp MCP running free on Cloudflare

https://github.com/finereli/whatsapp-mcp
98•zoozla•10h ago•48 comments

DeepSeek V4.1 Flash 1017 (Max)

https://artificialanalysis.ai/models/deepseek-v4-1-flash-1017
126•theanonymousone•3h ago•40 comments

I built a programming language that LLMs can't use

https://blog.picheta.me/post/killswitch-lang/
174•dom96•1d ago•122 comments

PalmOS Lemmings

https://github.com/ardiri/palmos-lemmings
123•memalign•14h ago•30 comments

One parser, two bugs, many routers: Exploiting Broadcom WiFi across eCos, Linux

https://quentinkaiser.be/security/2026/10/16/one-parser-two-bugs/
77•zoobab•2d ago•17 comments

Java sealed classes and exhaustive pattern matching

https://neilmadden.blog/2026/04/24/java-sealed-classes-and-exhaustive-pattern-matching/
165•hnisjafx40•17h ago•125 comments

How Postgres DELETE can actually scale

https://www.dbos.dev/blog/scaling-deletions-in-postgres
11•KraftyOne•3d ago•1 comments

macOS 15.8.2 Breaks OpenGL

https://developer.apple.com/forums/verify-human/verify.html?next=/forums/thread/850550
251•Audiophilip•17h ago•269 comments

A new way to think about borrow checking (in reverse)

https://verdagon.dev/blog/reverse-borrow-checking
72•verdagon•20h ago•7 comments

"I'm on a war footing": Terry Tao and the crisis in math

https://www.nytimes.com/2026/10/16/us/math-ai-terence-tao.html
169•vinipolicena•2d ago•325 comments

Open MicroManipulator – A sub-micrometer 3D motion control plattform

https://github.com/0x23/MicroManipulatorStepper
194•_Microft•21h ago•16 comments
Open in hackernews

The Beam

https://www.erlang-solutions.com/blog/the-beam-erlangs-virtual-machine/
105•Alupis•1y ago

Comments

schultzer•1y ago
One thing that is great about Erlang’s pattern matching is that it makes it extremely approachable for writing, lexer, parser and compilers in it: https://github.com/elixir-dbvisor/sql and with Elixir macros and sigils then you can embed other languages like sql and zig to name a few!
wk_end•1y ago
Does Erlang/Elixer have any edge over Ocaml or Haskell in that niche? They also have pattern matching, of course, and strong static types tend to work nicely for compilers too.

Of course, the big superpower they have is the BEAM and the robust multiprocessing support there, but that’s not especially helpful for compilers…or is it?

schultzer•1y ago
Elixir compiler is written in Erlang, Erlang can produce very efficient code, the new json library can beat c libraries at decoding / encoding. And you get this with a strongly typed dynamic language, which is a distributed language. It’s really hard to beat the BEAM, if only we had better number crunching, but in so cases you can always write a nif.
dcsommer•1y ago
"Strongly typed" is stretching it. Type checking is bolted on and not part of `erlc`. Typing is quite unergonomic in Erlang/Elixir (similar to Typescript bolted onto JS).

The type system is one of the weakest parts of the beam ecosystem.

troupo•1y ago
Elixir team is slowly bringing in type checking into the language: https://elixir-lang.org/blog/2022/10/05/my-future-with-elixi... and https://hexdocs.pm/elixir/gradual-set-theoretic-types.html
Munksgaard•1y ago
Erlang/Elixir are certainly strongly typed[0] but they are not statically typed[1].

0: https://en.wikipedia.org/wiki/Strong_and_weak_typing

1: https://en.wikipedia.org/wiki/Type_system#Static_type_checki...

lolinder•1y ago
You can't really use the word "certainly" when speaking about "strongly typed" because the entire concept is fuzzy and subjective. From the article you linked:

> > However, there is no precise technical definition of what the terms mean and different authors disagree about the implied meaning of the terms and the relative rankings of the "strength" of the type systems of mainstream programming languages. For this reason, writers who wish to write unambiguously about type systems often eschew the terms "strong typing" and "weak typing" in favor of specific expressions such as "type safety".

I personally think the whole concept of "strongly typed", which is usually used as a prop to make dynamic languages count as part of the cool kids typed-languages club, should be ditched as a point of argument. The supposed "weakly typed" languages people are usually comparing to (like C) aren't actually framed as viable alternative for problems dynamic languages are suited for, so they're something of a straw man. I'd like to see advocates for dynamically typed languages ditch the obsession with having types like the cool kids and instead focus on showing why dynamism is valuable.

There are plenty of great cases to make for dynamism without having to argue on rhetorical ground that the static languages defined and dominate.

Munksgaard•1y ago
As someone who has used both SML, Haskell, Rust and Elixir professionally: No, not really.

Access to the BEAM is nice, but unless you're targeting the BEAM in your compiler I don't see any benefit. Even if you're targeting the BEAM, you might decide to use another language, cf. Gleam: https://github.com/gleam-lang/gleam/

Edit: Actually, one thing I will mention is the superior support in Elixir/Erlang for pattern matching bitstrings[0]. Not usually helpful in compilers, but an evolution of pattern matching that other languages should take up, in my opinion.

0: https://hexdocs.pm/elixir/Kernel.SpecialForms.html#%3C%3C%3E...

tikhonj•1y ago
OCaml also has a binary string pattern matching feature which sounds pretty similar: https://practicalocaml.com/parsing-with-binary-string-patter...
Rendello•1y ago
Erlang's bitstring/binary handling is one of those things that once you use, you'll wonder why it's not in every language (alongside, for me, Rust's enum/sum types and Python's badly-named but wonderfully useful while-else).
xelxebar•1y ago
Studying the BEAM is definitely on my ToDo list. It's task parallelism sounds exemplar, and I really want to understand the architectural ramifications of choosing fine-grained task parallelism vs. a data parallel-friendly approach.
troupo•1y ago
I wish articles like this had more meat on why BEAM is good.

You have to say why it's good. E.g. https://news.ycombinator.com/item?id=28015852

brandonpollack2•1y ago
If only there was a typed language that didn't hand wave serialization
mrkeen•1y ago
I don't think we'll ever do better than 'IO is made out of bytes'.
kimi•1y ago
Like Java?
monkfish328•1y ago
Love beam

I just wish elixir had static typing built in :)

arrowsmith•1y ago
Give Elixir a try anyway, you might be surprised:

https://arrowsmithlabs.com/blog/you-might-not-need-gradual-t...

Taikonerd•1y ago
Then you'll love Gleam -- it's a BEAM language with static typing!

https://gleam.run/

idahoduncan•1y ago
The Strand programming book states that an early version of the Erlang runtime was implemented in Strand (see "13.1: History" http://www.call-with-current-continuation.org/files/strand-b...), which is an interesting tidbit that I haven't seen come up when the history of Erlang is discussed, like in the featured article.
kristel100•1y ago
It’s fascinating how long the BEAM has lasted. And even more fascinating how relevant its concurrency model still is in today’s async-heavy world. Built different.
Munksgaard•1y ago
I agree that the terminology is not ideal, but think there's a huge difference between JS' "weak types", i.e. abundant implicit conversions, and e.g. Elixirs "strong types", where `1 + "foo"` is a runtime error. I don't care if we call the latter something else though. Any good suggestions?

That said, I prefer having both strong and static typing, but that's another argument.

zbentley•1y ago
I'd suggest "high-cast" and "low-cast". They draw attention to the thing that people usually mean when they talk about strong (not static) typing: whether operations in a language bias towards automatically coercing types so that a non-type-error result can be produced or not. High-cast languages tend towards requiring explicit type conversion; low-cast languages tend towards both implicit conversion and more complex behaviors when more than one type is supplied to a given operation. Also, the terms pun nicely with "high-cost" and "low-cost".

That said, it's still a spectrum and there's a lot of subjectiveness here. Everyone agrees that '1 + "foo"' is meaningless, but what about string multiplication? If a language documents that an integer multiplied by a string repeats the string, is that weakly typed/low-cast, or is it just documented multiplication operator behavior? If string multiplication is a whole separate operator, is that more strongly typed (and if so, are we all gonna be able to sleep at night since that means Perl 5 is more strongly typed than Python)?

That subjectiveness extends into the domain of hidden runtime costs, as well. Theoretically, any iterable of hashable items can be passed to a language's implementation of "HashSet::union(items)". But the implementation/performance of "union()" might differ based on the type of the iterable: should we be allowed to pass a lazy iterator which produces values after arbitrary custom computations? Many languages say "yes" here, but some consider collecting/each-ing the iterator something that must be explicit so the cost/exhaustion/side-effectfulness of the iteration is made clear. How about unioning a set with a vector, versus another set? Very different algorithmic behavior happens inside the union if another hash set is supplied instead of, say, a static array or linked list; while the complexity for nonlazy unions is always O(N), the average complexity/wallclock performance may be very different. Rust's stdlib, for example, discourages this kind of heterogenous union (not, I suspect, out of a desire for high-cast-explicitness, but because it wants to encourage use of its lazy O(1) union system instead). Are the answers to that question part of the high-cast/low-cast (or strong/weak type system) spectrum, or are they just specific choices made by each language's collections library? Ask 10 programmers, and I suspect you'll get a lot of different answers.

cess11•1y ago
Dialyzer might be considered "bolted on", but the BEAM itself is strongly and dynamically typed. In Elixir the compiler is getting static typing as well.

https://learnyousomeerlang.com/types-or-lack-thereof

These languages have other properties that can play the role that types are sometimes relied upon to do. It's uncommon that I think in types at all when building things in Elixir, thinking about shapes usually gets me all the way.

In my experience string processing libraries are the weakest part, due to some of them having abysmal performance for whatever reason. Last I had this problem I wanted to do ETL on mbox files but gave up and did it with someone's PHP one-class weekend project instead.

cess11•1y ago
You probably don't, Numerical Elixir/Nx has been out for years and did the NIF:ing for you.

It's one part of why it's quite convenient to juggle ML and LLM tasks on the BEAM, and easy enough that I can manage it.

https://github.com/elixir-nx