Makoto Hamana - Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers

lmcs:6600 - Logical Methods in Computer Science, June 14, 2022, Volume 18, Issue 2 - https://doi.org/10.46298/lmcs-18(2:18)2022
Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers

Authors: Makoto Hamana

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 SOL is effective to solve higher-order termination problems.


Volume: Volume 18, Issue 2
Published on: June 14, 2022
Accepted on: April 2, 2022
Submitted on: June 26, 2020
Keywords: Computer Science - Symbolic Computation,Computer Science - Logic in Computer Science


Share

Consultation statistics

This page has been seen 251 times.
This article's PDF has been downloaded 304 times.