## Semantics of linear continuation-passing in call-by-name (2004)

Venue: | In Proc. Functional and Logic Programming, Springer Lecture Notes in Comput. Sci |

Citations: | 6 - 4 self |

### BibTeX

@INPROCEEDINGS{Hasegawa04semanticsof,

author = {Masahito Hasegawa},

title = {Semantics of linear continuation-passing in call-by-name},

booktitle = {In Proc. Functional and Logic Programming, Springer Lecture Notes in Comput. Sci},

year = {2004},

pages = {229--243}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for categories of linear continuations, which gives rise to cartesian closed categories with “linear classical disjunctions ” from models of intuitionistic linear logic with sums. On the syntactic side, we give a simply typed call-by-name λµcalculus in which the use of names (continuation variables) is restricted to be linear. Its semantic interpretation into a category of linear continuations then amounts to the call-by-name continuation-passing style (CPS) transformation into a linear lambda calculus with sum types. We show that our calculus is sound for this CPS semantics, hence for models given by the categories of linear continuations.