Hacker News .hn
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
nodra
3 months ago
|
parent
|
context
|
favorite
| on:
RE#: how we built the fastest regex engine in F#
Care to explain? Pattern matching, type inference, etc.?
Nelkins
3 months ago
|
next
[–]
Various investigations have found it to be one of the most token efficient statically typed programming languages
https://martinalderson.com/posts/which-programming-languages...
balakk
3 months ago
|
prev
[–]
It's all about the goddamned machines.. since F# is terse, they figure agent-generated F# code is cheaper.
KurtMueller
3 months ago
|
parent
[–]
I like to think of F# as concise.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
