The author discusses the theoretical challenges of adding recursion to 'λFS', a language combining functional and relational programming, specifically focusing on how evaluation order impacts termination. The post highlights the complexity of handling nontermination without relying on traditional domain theory, noting that even untyped lambda calculus exhibits different termination behaviors under call-by-name versus call-by-value.
Background
λFS is a research programming language designed to unify functional programming concepts with relational algebra and Datalog-style queries, treating relations as finite functions.
- Source
- Lobsters
- Published
- Jun 29, 2026 at 10:47 PM
- Score
- 6.0 / 10