Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus

Authors:
Masahito Hasegawa
Affiliations:
-
Venue:
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Year:
2002

Citing 10
Cited 13

Linear logic

Theoretical Computer Science
Computational lambda-calculus and monads

Proceedings of the Fourth Annual Symposium on Logic in computer science
Reasoning about programs in continuation-passing style.

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
What is a Categorical Model of Intuitionistic Linear Logic?

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Axioms for Recursion in Call-by-Value

FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Classical Linear Logic of Implications

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Linear Logic, Monads and the Lambda Calculus

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Complete Axioms for Categorical Fixed-Point Operators

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Girard translation and logical predicates

Journal of Functional Programming
Sequentiality and the π-calculus

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications

Linear Continuation-Passing

Higher-Order and Symbolic Computation
Classical Linear Logic of Implications

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A sound and complete axiomatization of delimited continuations

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Classical linear logic of implications

Mathematical Structures in Computer Science
Game semantics and linear CPS interpretation

Theoretical Computer Science - Foundations of software science and computation structures
Extensional Universal Types for Call-by-Value

APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
A game semantics of linearly used continuations

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Enriching an effect calculus with linear types

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Preface

Theoretical Computer Science
An equivalence-preserving CPS translation via multi-language semantics

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
A terminating and confluent linear lambda calculus

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Linearly-Used continuations in the enriched effect calculus

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Remarks on semantic completeness for proof-terms with Laird's dual affine/intuitionistic λ-Calculus

Rewriting Computation and Proof

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a semantic and syntactic framework for modelling linearly used effects, by giving the monadic transforms of the computational lambda calculus (considered as the core calculus of typed call-by-value programming languages) into the linear lambda calculus. As an instance Berdine et al.'s work on linearly used continuations can be put in this general picture. As a technical result we show the full completeness of the CPS transform into the linear lambda calculus.