Youyou Cong ; Chiaki Ishio ; Kaho Honda ; Kenichi Asai - A Functional Abstraction of Typed Invocation Contexts

lmcs:8581 - Logical Methods in Computer Science, September 15, 2022, Volume 18, Issue 3 - https://doi.org/10.46298/lmcs-18(3:34)2022
A Functional Abstraction of Typed Invocation Contexts

Authors: Youyou Cong ; Chiaki Ishio ; Kaho Honda ; Kenichi Asai

    In their paper "A Functional Abstraction of Typed Contexts", Danvy and Filinski show how to derive a monomorphic type system of the shift and reset operators from a CPS semantics. In this paper, we show how this method scales to Felleisen's control and prompt operators. Compared to shift and reset, control and prompt exhibit a more dynamic behavior, in that they can manipulate a trail of contexts surrounding the invocation of previously captured continuations. Our key observation is that, by adopting a functional representation of trails in the CPS semantics, we can derive a type system that encodes all and only constraints imposed by the CPS semantics.


    Volume: Volume 18, Issue 3
    Published on: September 15, 2022
    Accepted on: September 9, 2022
    Submitted on: October 15, 2021
    Keywords: Computer Science - Programming Languages

    Share

    Consultation statistics

    This page has been seen 462 times.
    This article's PDF has been downloaded 211 times.