arXiv Open Access 2019

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

Makoto Hamana

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.SC cs.LO

Penulis (1)

Makoto Hamana

Format Sitasi

APA MLA BibTeX

Hamana, M. (2019). Modular Termination for Second-Order Computation Rules and Application to Algebraic Effect Handlers. https://arxiv.org/abs/1912.03434

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2019
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓