Continuation-passing style

Résumé

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

Source officielle

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

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (3)

Publications associées

Chargement

Personnes associées

Chargement

Unités associées

Chargement

Concepts associés (14)

Concepts associés

Chargement

Cours associés (3)

Cours associés

Chargement

Séances de cours associées (10)

Afficher plus

Séances de cours associées

Chargement

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

Chargement

, ,

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

Chargement

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

Chargement