Similar Items: Strongly-Normalizing Higher-Order Relational Queries
- On completeness of reducibility candidates as a semantics of strong normalization
- Asymptotically almost all lambda-terms are strongly normalizing
- Higher Order Automatic Differentiation of Higher Order Functions
- First-order query evaluation on structures of bounded degree
- First-order queries on classes of structures with bounded expansion
- Executable First-Order Queries in the Logic of Information Flows