Similar Items: Complete Call-by-Value Calculi of Control Operators II: Strong Termination
- Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types
- Strong normalisation for applied lambda calculi
- Call-by-value Termination in the Untyped lambda-calculus
- Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi
- An expressive completeness theorem for coalgebraic modal mu-calculi
- Strongly Complete Logics for Coalgebras