MODULAR TERMINATION FOR SECOND-ORDER COMPUTATION RULES AND APPLICATION TO ALGEBRAIC EFFECT HANDLERS.

We present a new modular proof method of termination for second-order computation, and report its implementation SOL. The proof method is useful for proving termination of higher-order foundational calculi. To establish the method, we use a variation of the semantic labelling translation and Blanqui's General Schema: a syntactic criterion of strong normalisation. an application, we show termination of a variant of call-by-push-value calculus with algebraic effects, an effect handler and effect theory. We also show that our tool SOL is effective to solve higher-order termination problems. [ABSTRACT FROM AUTHOR]