How to CPS Transform a Monad

Authors:
Annette Bieniusa;Peter Thiemann
Affiliations:
Institut für Informatik, Universität Freiburg, Freiburg, Germany 79110;Institut für Informatik, Universität Freiburg, Freiburg, Germany 79110
Venue:
CC '09 Proceedings of the 18th International Conference on Compiler Construction: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Year:
2009

Citing 33
Cited 1

ORBIT: an optimizing compiler for scheme

SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Realistic compilation by program transformation (detailed summary)

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Comprehending monads

LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Notions of computation and monads

Information and Computation
Compiling with continuations

Compiling with continuations
Two-level functional languages

Two-level functional languages
CPS-transformation after strictness analysis

ACM Letters on Programming Languages and Systems (LOPLAS)
The essence of compiling with continuations

PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Imperative functional programming

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A generic account of continuation-passing styles

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Back to direct style

ESOP'92 Selected papers of the symposium on Fourth European symposium on programming
Reasoning about programs in continuation-passing style

Lisp and Symbolic Computation - Special issue on continuations—part I
Concurrent Haskell

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A reflection on call-by-value

ACM Transactions on Programming Languages and Systems (TOPLAS)
Compiling standard ML to Java bytecodes

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Representing layered monads

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A semantics for imprecise exceptions

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Stochastic lambda calculus and monads of probability distributions

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The marriage of effects and monads

ACM Transactions on Computational Logic (TOCL)
Reflections on Reflections

PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Rabbit: A Compiler for Scheme

Rabbit: A Compiler for Scheme
Kleisli, a functional query system

Journal of Functional Programming
Thunks and the λ-calculus

Journal of Functional Programming
Automatically Restructuring Programs for the Web

Automated Software Engineering
A probabilistic language based upon sampling functions

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From sequential programs to multi-tier applications by program transformation

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An embedded domain-specific language for type-safe server-side web scripting

ACM Transactions on Internet Technology (TOIT)
Monadic regions

Journal of Functional Programming
HOP: achieving efficient anonymity in MANETs by combining HIP, OLSR, and pseudonyms

Companion to the 21st ACM SIGPLAN symposium on Object-oriented programming systems, languages, and applications
A functional correspondence between monadic evaluators and abstract machines for languages with computational effects

Theoretical Computer Science - Applied semantics: Selected topics
Compiling with continuations, continued

ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Essentials of Programming Languages, 3rd Edition

Essentials of Programming Languages, 3rd Edition
Links: web programming without tiers

FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects

Feel different on the Java platform: the star programming language

Proceedings of the 2013 International Conference on Principles and Practices of Programming on the Java Platform: Virtual Machines, Languages, and Tools

Quantified Score

Hi-index	0.00

Visualization

Abstract

CPS transformation is an important tool in the compilation of functional programming languages. For strict languages, such as our web programming language "Rinso" or Microsoft's F#, monadic expressions can help with structuring and composing computations. To apply a CPS transformation in the compilation process of such a language, we integrate explicit monadic abstraction in a call-by-value source language, present a Danvy-Filinski-style CPS transformation for this extension, and verify that the translation preserves simple typing. We establish the simulation properties of this transformation in an untyped setting and relate it to a two stage transformation that implements the monadic abstraction with thunks and introduces continuations in a second step. Furthermore, we give a direct style translation which corresponds to the monadic translation.