On the semantics of the call-by-name CPS transform
From MaRDI portal
Publication:1575687
DOI10.1016/S0304-3975(99)00302-3zbMath0944.68120MaRDI QIDQ1575687
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
A process algebraic view of Linda coordination primitives, On bisimulations for the asynchronous \(\pi\)-calculus, Infinitary lambda calculus and discrimination of Berarducci trees., A Complete, Co-inductive Syntactic Theory of Sequential Control and State
Cites Work
- Unnamed Item
- Unnamed Item
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- The \(\pi\)-calculus in direct style
- The lazy lambda calculus in a concurrency scenario
- Functions as processes
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- Thunks and the λ-calculus