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 semantic labelling translation and Blanqui...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 18, Issue 2
Main Author:	Hamana, Makoto
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 14.06.2022
Subjects:	computer science - logic in computer science computer science - symbolic computation
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!