Continuation-passing style

Summary

In functional programming, continuation-passing style (CPS) is a style of programming in which control is passed explicitly in the form of a continuation. This is contrasted with direct style, which is the usual style of programming. Gerald Jay Sussman and Guy L. Steele, Jr. coined the phrase in AI Memo 349 (1975), which sets out the first version of the Scheme programming language. John C. Reynolds gives a detailed account of the numerous discoveries of continuations. A function written in continuation-passing style takes an extra argument: an explicit "continuation"; i.e., a function of one argument. When the CPS function has computed its result value, it "returns" it by calling the continuation function with this value as the argument. That means that when invoking a CPS function, the calling function is required to supply a procedure to be invoked with the subroutine's "return" value. Expressing code in this form makes a number of things explicit which are implicit in direct st

Official source

https://en.wikipedia.org/wiki/Continuation-passing_style

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (3)

Related publications

Related people

Related units

Related concepts (14)

Related concepts

Related courses (3)

Students learn several implementation techniques for modern functional and object-oriented programming languages. They put some of them into practice by developing key parts of a compiler and run time system for a simple functional programming language.

Étudier les concepts fondamentaux d'analyse et le calcul différentiel et intégral des fonctions réelles de plusieurs variables.

Concepts de base de l'analyse fonctionnelle linéaire: opérateurs bornés, opérateurs compacts, théorie spectrale pour les opérateurs symétriques et compacts, le théorème de Hahn-Banach, les théorèmes de l'application ouverte et du graphe fermé.

Related courses

Related lectures (10)

Related lectures

Deprecating the Observer Pattern with Scala.React

Ingo Maier, Martin Odersky

Programming interactive systems by means of the observer pattern is hard and error-prone yet is still the implementation standard in many production environments. We show how to integrate different reactive programming abstractions into a single framework that help migrate from observer-based event handling logic to more declarative implementations. Our central API layer embeds an extensible higher-order data-flow DSL into our host language. This embedding is enabled by a continuation passing style transformation.

2012

Deprecating the Observer Pattern

Ingo Maier, Martin Odersky, Tiark Rompf

Programming interactive systems by means of the observer pattern is hard and error-prone yet is still the implementation standard in many production environments. We present an approach to gradually deprecate observers in favor of reactive programming abstractions. Several library layers help programmers to smoothly migrate existing code from callbacks to a more declarative programming model. Our central high-level API layer embeds an extensible higher-order data-flow DSL into our host language. This embedding is enabled by a continuation passing style transformation.

2010

Continuation of eigenvalues and invariant pairs for parameterized nonlinear eigenvalue problems

Peter Cedric Effenberger, Daniel Kressner

Invariant pairs have been proposed as a numerically robust means to represent and compute several eigenvalues along with the corresponding (generalized) eigenvectors for matrix eigenvalue problems that are nonlinear in the eigenvalue parameter. In this work, we consider nonlinear eigenvalue problems that depend on an additional parameter and our interest is to track several eigenvalues as this parameter varies. Based on the concept of invariant pairs, a theoretically sound and reliable numerical continuation procedure is developed. Particular attention is paid to the situation-when the procedure approaches a singularity, that is, when eigenvalues included in the invariant pair collide with other eigenvalues. For the real generic case, it is proven that such a singularity only occurs when two eigenvalues collide on the real axis. It is shown how this situation can be handled numerically by an appropriate expansion of the invariant pair. The viability of our continuation procedure is illustrated by a numerical example.

Springer-Verlag2011