Andrzej Filinski  Home/Search
Context Related
| cmu.edu/user/andrzej/pub/RM.ps.Z dcs.ed.ac.uk/~aof/papers/RM.ps.Z brics.dk/~andrzej/papers/RM.ps.gz 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: cmu.edu/user/andrzej/pub...README (more) From: brics.dk/~andrzej/papers/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that any monad whose unit and extension operations are expressible as purely functional terms can be embedded in a call-by-value language with "composable continuations". As part of the development, we extend Meyer and Wand's characterization of the relationship between continuation-passing and direct style to one for continuation-passing vs. general "monadic" style. We further show that the composablecontinuations construct can itself be represented using ordinary, non-composable... (Update)
Cited by: More
An Operational Foundation for Delimited Continuations.. - Biernacka, Biernacki.. (2004) (Correct)
A Functional Correspondence between Monadic Evaluators and.. - Ager (2004) (Correct)
From Interpreter to Logic Engine by Defunctionalization - Danvy, Danvy (2004) (Correct)
Active bibliography (related documents): More All
0.7: Controlling Effects - Filinski (1996) (Correct)
0.4: The Formal Relationship Between Direct and Continuation-Passing.. - Sabry (1994) (Correct)
0.4: The Formal Relationship between Direct and Continuation-Passing.. - Sabry (1994) (Correct)
Similar documents based on text: More All
0.6: Monads and Composable Continuations - Wadler (1993) (Correct)
0.2: Axioms for Recursion in Call-by-Value - Hasegawa, Kakutani (Correct)
0.2: Combining Monads - King, Wadler (1992) (Correct)
Related documents from co-citation: More All
25: Reasoning about programs in continuation-passing style - Sabry, Felleisen
24: Information and Computation (context) - Moggi, computation - 1991
23: Type-directed partial evaluation - Danvy
BibTeX entry: (Update)
Andrzej Filinski. Representing monads. In Conference Record of POPL '94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, Oregon, pages 446--457, New York, January 1994. ACM Press. http://citeseer.ist.psu.edu/filinski94representing.html More
@incollection{ filinski94representing,
author = "Andrzej Filinski",
title = "Representing Monads",
booktitle = "Conf.\ Record 21st {ACM} {SIGPLAN}-{SIGACT} Symp.\ on Principles of Programming Languages, {POPL}'94, Portland, {OR}, {USA}, 17--21 Jan.\ 1994",
publisher = "ACM Press",
address = "New York",
pages = "446--457",
year = "1994",
url = "citeseer.ist.psu.edu/filinski94representing.html" }
Citations (may not include all citations):369 Information and Computation (context) - Moggi, computation - 1991
293 The essence of functional programming - Wadler - 1992
291 Computational lambda-calculus and monads - Moggi - 1989
283 Theoretical Computer Science (context) - Plotkin, call-by-value et al. - 1975
254 Revised 4 report on the algorithmic language Scheme - Clinger, Rees - 1991
244 Imperative functional programming - Jones, Wadler - 1993
178 Standard ML of New Jersey - Appel, MacQueen - 1991
159 CML: A higher-order concurrent language (context) - Reppy - 1991
158 Reasoning about programs in continuation-passing style - Sabry, Felleisen - 1992
138 The revised report on the syntactic theories of sequential c.. - Felleisen, Hieb - 1992
81 The theory and practice of firstclass prompts (context) - Felleisen - 1988
69 Typing first-class continuations in ML - Duba, Harper et al. - 1991
67 Representing control in the presence of firstclass continuat.. - Hieb, Dybvig et al. - 1990
66 Continuation semantics in typed lambda-calculi - Meyer, Wand - 1985
66 Abstracting control - Danvy, Filinski - 1990
55 Representing control: A study of the CPS transformation - Danvy, Filinski - 1992
54 Building interpreters by composing monads - Steele - 1994
54 The mystery of the tower revealed: A non-reflective descript.. (context) - Wand, Friedman - 1988
52 the relation between direct and continuation semantics (context) - Reynolds - 1974
48 Laboratory for Foundations of Computer Science (context) - Moggi, view et al. - 1990
46 Massachusetts Institute of Technology (context) - Smith, Semantics et al. - 1982
41 Continuationbased partial evaluation - Lawall, Danvy - 1993
36 Reasoning with continuations II: Full abstraction for models.. - Sitaram, Felleisen - 1990
35 Abstract continuations: A mathematical semantics for handlin.. (context) - Felleisen, Wand et al. - 1988
27 Lisp and Symbolic Computation (context) - Sitaram, Felleisen et al. - 1990
24 A dynamic extent control operator for partial continuations - Queinnec, Serpette - 1991
16 Stores and partial continuations as first-class objects in a.. (context) - Johnson, Duggan - 1988
13 Delimiting the scope of effects - Riecke - 1993
10 Lisp and Symbolic Computation (context) - Wadler, composable - 1994
10 and pseudo-classical type systems: A-translation at work (context) - Murthy, hierarchies - 1992
10 The congruence of two programming language definitions (context) - Stoy - 1981
9 Constructing call-byvalue continuation semantics (context) - Sethi, Tang - 1980
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/afs/cs.cmu.edu/user/andrzej/pub/README.html): More
Declarative Continuations and Categorical Duality - Filinski (1989) (Correct)
Recursion from Iteration - Filinski (1994) (Correct)
Controlling Effects - Filinski (1996) (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