← Back to context Comment by nodra 14 hours ago Care to explain? Pattern matching, type inference, etc.? 3 comments nodra Reply Nelkins 14 hours ago Various investigations have found it to be one of the most token efficient statically typed programming languageshttps://martinalderson.com/posts/which-programming-languages... balakk 14 hours ago It's all about the goddamned machines.. since F# is terse, they figure agent-generated F# code is cheaper. KurtMueller 13 hours ago I like to think of F# as concise.
Nelkins 14 hours ago Various investigations have found it to be one of the most token efficient statically typed programming languageshttps://martinalderson.com/posts/which-programming-languages...
balakk 14 hours ago It's all about the goddamned machines.. since F# is terse, they figure agent-generated F# code is cheaper. KurtMueller 13 hours ago I like to think of F# as concise.
Various investigations have found it to be one of the most token efficient statically typed programming languages
https://martinalderson.com/posts/which-programming-languages...
It's all about the goddamned machines.. since F# is terse, they figure agent-generated F# code is cheaper.
I like to think of F# as concise.