Treffer: Linear continuation-passing
Title:
Linear continuation-passing
Authors:
Source:
Special Issue on the Third ACM SIGPLAN Workshop on Continuations (CW'01)Higher-order and symbolic computation. 15(2-3):181-208
Publisher Information:
Heidelberg: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 39 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Théorie programmation, Programming theory, Backtracking, Calcul symbolique, Symbolic computation, Cálculo simbólico, Exception, Exceptions, Langage programmation, Programming language, Lenguaje programación, Théorie programmation, Programming theory, CPS, Continuation passing style, LCPS, Linear continuation passing style, Langage cible, Target language
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, Queen Mary, University of London, London E1 4NS, United Kingdom
School of Computer Science, The University of Birmingham, Birmingham B15 2TT, United Kingdom
School of Computer Science, The University of Birmingham, Birmingham B15 2TT, United Kingdom
ISSN:
1388-3690
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.14372037
Database:
PASCAL Archive
Weitere Informationen
Continuations can be used to explain a wide variety of control behaviours, including calling/returning (procedures), raising/handling (exceptions), labelled jumping (goto statements), process switching (coroutines), and backtracking. However, continuations are often manipulated in a highly stylised way, and we show that all of these, bar backtracking, in fact use their continuations linearly; this is formalised by taking a target language for cPs transforms that has both intuitionistic and linear function types.