A unifying framework for continuity and complexity in higher types
We set up a parametrised monadic translation for a class of call-by-value functional languages, and prove a corresponding soundness theorem. We then present a series of concrete instantiations of our translation, demonstrating that a number of fundamental notions concerning higher-order computation,...
| Auteur principal: | |
|---|---|
| Format: | Article |
| Langue: | English |
| Publié: |
Logical Methods in Computer Science e.V.
2020-09-01
|
| Collection: | Logical Methods in Computer Science |
| Sujets: | |
| Accès en ligne: | https://lmcs.episciences.org/5746/pdf |