Carsten Führmann, Hayo Thielecke  Home/Search
Context Related
| cs.bham.ac.uk/~hxt/research/cont.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.bham.ac.uk/~hxt/res...htpapers (more) Homepages: H.Thielecke |
Rate this article:      (best)Comment on this article |
Abstract: We investigate continuations in the context of idealized call-by-value programming languages. On the semantic side, we analyze the categorical structures that arise from continuation models of call-by-value languages. On the syntactic side, we study the call-by-value continuation-passing transformation as a translation between equational theories. Among the novelties are an unusually simple axiomatization of control operators and a strengthened completeness result with a proof based on a... (Update)
Context of citations to this paper: More
...can be applied to the type free case. Recently Fuhrmann and Thielecke presented a refined proof and axiomatization in a typed setting [12]. Sabry [24] proposed an elegant technique to obtain a sound and complete axiomatization with respect to a CPS semantics. He applied it to a...
Cited by: More
Algebraic Operations and Generic Effects - Plotkin, Power (Correct)
Combining Continuations with Other Effects - Hyland, Levy, Plotkin, Power (Correct)
A Sound and Complete Axiomatization of Delimited Continuations - Kameyama, Hasegawa (2003) (Correct)
Active bibliography (related documents): More All
0.6: Duality between Call-by-Name Recursion and Call-by-Value Iteration - Kakutani (2001) (Correct)
0.5: Categorical Structure of Continuation Passing Style - Thielecke (1997) (Correct)
0.4: Axioms for Recursion in Call-by-Value - Hasegawa, Kakutani (Correct)
Similar documents based on text: More All
0.2: Equational Lifting Monads - Bucalo, Führmann, Simpson (1999) (Correct)
0.1: Remarks on Orthogonal Polynomials and Balanced Realizations - Hoffmann, Fuhrmann (1995) (Correct)
0.1: An Equational Notion of Lifting Monad - Bucalo, Führmann, Simpson (2003) (Correct)
Related documents from co-citation: More All
2: Monads and e#ects (context) - Benton, Hughes et al. - 2000
2: Notions of computations and monads - Moggi - 1989
2: Sound and complete axiomatisations of callby -value control operators - Hofmann - 1994
BibTeX entry: (Update)
C. Fuhrmann and H. Thielecke. On the Call-by-Value CPS Transform and its Semantics. Information and Computation, to appear. http://citeseer.ist.psu.edu/624137.html More
@misc{ fuhrmann-callbyvalue,
author = "C. F{\"u}hrmann and H. Thielecke",
title = "On the Call-by-Value {CPS} Transform and its Semantics",
url = "citeseer.ist.psu.edu/624137.html" }
Citations (may not include all citations):562 Categories for the Working Mathematician (context) - Lane - 1971
521 Compiling with Continuations (context) - Appel - 1992
369 Information and Computation (context) - Moggi, computation - 1991
291 Computational lambda-calculus and monads - Moggi - 1989
158 Reasoning about programs in continuation-passing style - Sabry, Felleisen - 1993
116 Rabbit: A compiler for Scheme (context) - Steele - 1978
110 A formulae-as-types notion of control - Gri - 1990
77 Lisp and Symbolic Computation (context) - Reynolds, of - 1993
71 Lambda-calculus schemata - Fischer - 1972
69 Typing first-class continuations in ML - Duba, Harper et al. - 1991
61 Continuations: A mathematical semantics for handling full ju.. (context) - Strachey, Wadsworth - 2000
55 call-by-value and the #-calculus (context) - Plotkin - 1975
38 Mathematical Structures in Computer Science (context) - Power, Robinson et al. - 1997
36 Pi-calculus in direct style - Boudol - 1997
34 Reasoning with continuations (context) - Felleisen, Friedman et al. - 1986
32 Declarative continuations: an investigation of duality in pr.. (context) - Filinski - 1989
30 Control categories and duality: on the categorical semantics.. - Selinger - 2001
23 Revised report on the algorithmic language Scheme (context) - Abelson, Dybvig et al. - 1998
23 Categorical Structure of Continuation Passing Style - Thielecke - 1997
15 UNIVAC Systems Programming Research (context) - Landin, of et al. - 1965
15 Sound and complete axiomatisations of call-by-value control .. - Hofmann - 1995
12 Higher-Order and Symbolic Computation (context) - Landin, of et al. - 1998
9 Technical Report ECS-LFCS (context) - Moggi, monads - 1988
9 Direct models of the computational lambda-calculus (context) - Fuhrmann - 1999
7 and Olivier Danvy (context) - Hatcli - 1997
6 Lisp and Symbolic Computation (context) - Filinski, iteration - 1994
5 Axioms for recursion in call-by-value - Hasegawa, Kakutani - 2002
5 Thunks: a way of compiling procedure statements with some co.. (context) - Ingerman - 1961
5 Theory and Applications of Categories (context) - Taylor, continuations - 2002
4 The structure of call-by-value (context) - Fuhrmann - 2000
3 Closed Freyd- and kappa-categories (context) - Power, Thielecke - 1999
Documents on the same site (http://www.cs.bham.ac.uk/~hxt/research/htpapers.html): More
Contrasting Exceptions and Continuations - Thielecke (2001) (Correct)
Linear Continuation-Passing - Berdine, O'Hearn, Reddy, Thielecke (2002) (Correct)
From Control Effects to Typed Continuation Passing - Thielecke (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC