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 semantic labelling translation and Blanqui's General Schema: a syntactic criterion of strong normalisation. As an application, we apply this method to show termination of a variant of call-by-push-value calculus with algebraic effects and effect handlers. We also show that our tool SOLl is effective to solve higher-order termination problems.

中文翻译：

---

二阶计算规则的模块化终止和代数效应处理程序的应用

我们提出了一种新的二阶计算终止的模块化证明方法，并报告了它的实现 SOL。证明方法可用于证明高阶基础演算的终止。为了建立该方法，我们使用语义标签翻译的变体和布朗基的一般模式：强规范化的句法标准。作为一个应用程序，我们应用此方法来显示具有代数效果和效果处理程序的 call-by-push-value 演算变体的终止。我们还表明我们的工具 SOLl 可以有效地解决高阶终止问题。