Similar Items: On completeness of reducibility candidates as a semantics of strong normalization
- Strongly Complete Logics for Coalgebras
- Strongly-Normalizing Higher-Order Relational Queries
- Asymptotically almost all lambda-terms are strongly normalizing
- Symbolic and Asynchronous Semantics via Normalized Coalgebras
- Complete Call-by-Value Calculi of Control Operators II: Strong Termination
- On completeness and parametricity in the realizability semantics of System F