A Functional Abstraction of Typed Invocation Contexts
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 sh...
| Published in: | Logical Methods in Computer Science |
|---|---|
| Main Authors: | , , , |
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2022-09-01
|
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/8581/pdf |