Evaluation order and nontermination in query languages
Summary
The article discusses evaluation order and nontermination in query languages, focusing on λFS and the tension between database-driven execution plans and functional/declarative semantics. It outlines three forward-looking semantic approaches for recursion with nonterminating functions, and provides concrete examples to illustrate how evaluation order can affect termination and performance.