On the relation of interaction semantics to continuations and defunctionalization
From MaRDI portal
Abstract: In game semantics and related approaches to programming language semantics, programs are modelled by interaction dialogues. Such models have recently been used in the design of new compilation methods, e.g. for hardware synthesis or for programming with sublinear space. This paper relates such semantically motivated non-standard compilation methods to more standard techniques in the compilation of functional programming languages, namely continuation passing and defunctionalization. We first show for the linear {lambda}-calculus that interpretation in a model of computation by interaction can be described as a call-by-name CPS-translation followed by a defunctionalization procedure that takes into account control-flow information. We then establish a relation between these two compilation methods for the simply-typed {lambda}-calculus and end by considering recursion.
Recommendations
Cited in
(6)- Computation by interaction for space-bounded functional programming
- Call-by-value in a basic logic for interaction
- From geometry of interaction to denotational semantics
- scientific article; zbMATH DE number 7450001 (Why is no real title available?)
- On interaction, continuations and defunctionalization
- (Definitely not) boring interaction abstract machines
This page was built for publication: On the relation of interaction semantics to continuations and defunctionalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938764)
