Evaluation order and nontermination in query languages

·Hacker News··

blog datafun talon reviews résumé rss June 2026 Evaluation order and nontermination in query languages Last month I gave a talk at FLOPS about finite functional programming or ‘λFS’, my latest attempt (previously: Datafun) to combine functional programming with relational programming à la Datalog or SQL – and tensor algebra too, because why not? In λFS, a relation R is treated as a function: we let R(x) = true iff x is in R, false otherwise. This function is finite in that R(x) = true for

Read full article →

Related Articles

Unauthenticated remote code execution in Nginx
speedping · Hacker News · 1d ago
Cooling buildings is overtaking heating them as an energy need, IEA says
robtherobber · Hacker News · 8h ago
Ruby2ßhell: Pre-authentication RCE on stock Rails
jdns · Hacker News · 18h ago
Pancreatic cancer halted by virus injection in three patients
cybermango · Hacker News · 5h ago
Highly classified US national security communications network goes down
monkeydust · Hacker News · 2d ago