News for hackers. Stuff that matters.
Re:Show HN: CEL by Example by talideon on Wednesday February 18, 2026 @12:06PM (#47063294)
No, they're equating _Turing completeness_ with _might not terminate_. CEL, Expr, Rego, and other languages like them are intended to guarantee to complete. You can't do that cleanly with a Turing complete language.
Re:Show HN: CEL by Example by IshKebab on Wednesday February 18, 2026 @01:09PM (#47064110)
Right but "guaranteed to terminate" is not a useful property. You could write a program that terminates... after a billion years.
Re:Show HN: CEL by Example by dilyevsky on Wednesday February 18, 2026 @01:43PM (#47064578)
You can estimate cost of CEL program using static analysis before running it. "estimate" only because size of runtime data is generally unknown (but obv you could limit that).
Re:Show HN: CEL by Example by IshKebab on Wednesday February 18, 2026 @04:07PM (#47066407)
"You can" - in theory, or does this actually exist?
Re:Show HN: CEL by Example by dilyevsky on Wednesday February 18, 2026 @04:21PM (#47066598)
Re:Show HN: CEL by Example by AlecBG on Wednesday February 18, 2026 @06:17PM (#47067748)
With certain macros disabled like .map the runtime is O(code length)!
Re:Show HN: CEL by Example by akshayshah on Wednesday February 18, 2026 @11:08PM (#47069811)
There’s a whole section on this on TFA: https://celbyexample.com/execution-cost/