- λFS combines functional programming with relational programming, treating relations as finite functions.
- Nontermination in recursion introduces challenges with evaluation order and semantics.
- Three evaluation strategies discussed: left-to-right, nondeterministic, and parallel 'and'.
- Left-to-right evaluation offers predictability but may be inefficient for cyclic queries.
- Nondeterministic evaluation allows optimization but complicates compositional reasoning.
- Parallel 'and' restores determinism and symmetry but is difficult to implement efficiently.