A Modular Termination Method for Second-Order Computation

12/07/2019

∙

by   Makoto Hamana, et al.

∙

0

∙

share

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 show termination of extensions of Moggi's computational metalanguage with recursor. We also show that our tool SOL is effective to solve higher-order termination problems.