Aleksandar Nanevski  Home/Search
Context Related
| cmu.edu/anon/2003/CMUCS03149.ps 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/anon/2003/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In their purest formulation, monads are used in functional programming for two purposes: (1) to hygienically propagate effects, and (2) to globalize the effect scope -- once an effect occurs, the purity of the surrounding computation cannot be restored. As a consequence, monadic typing does not provide very naturally for the practically important ability to handle effects, and there is a number of previous works directed toward remedying this deficiency. It is mostly based on extending the... (Update)
Cited by: More
A Programming Language for Probabilistic Computation - Park (2005) (Correct)
Active bibliography (related documents): More All
0.8: A Sound and Complete Axiomatization of Delimited Continuations - Kameyama, Hasegawa (2003) (Correct)
0.7: Towards Logical Understanding of Delimited Continuations - Kameyama (2001) (Correct)
0.6: A Modal Language for Effects - Park, Harper (2004) (Correct)
Similar documents based on text: More All
0.2: Automatic Generation of Staged Geometric Predicates - Nanevski, Blelloch, Harper (2001) (Correct)
0.2: Meta-Programming with Names and Necessity - Nanevski, Pfenning (2002) (Correct)
0.1: A Modal Foundation for Meta-Variables - Nanevski, Pientka, Pfenning (2003) (Correct)
BibTeX entry: (Update)
A. Nanevski. A modal calculus for effect handling. Technical Report CMU-CS-03-149, School of Computer Science, Carnegie Mellon University, 2003. http://citeseer.ist.psu.edu/article/nanevski03modal.html More
@techreport{ nanevski03modal,
author = "A. Nanevski",
title = "A modal calculus for effect handling",
number = "CMU-CS-03-149",
institution = "School of Computer Science, Carnegie Mellon University",
year = "2003",
url = "citeseer.ist.psu.edu/article/nanevski03modal.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1997
862 The Java Language Specification - Gosling, Joy et al. - 1997
369 Information and Computation (context) - Moggi, computation - 1991
306 A syntactic approach to type soundness - Wright, Felleisen - 1994
293 The essence of functional programming - Wadler - 1992
291 Computational lambda-calculus and monads - Moggi - 1989
143 A modal analysis of staged computation - Davies, Pfenning - 2001
124 Monads for functional programming - Wadler - 1995
84 Mathematical Structures in Computer Science (context) - Pfenning, Davies et al. - 2001
81 The theory and practice of first-class prompts (context) - Felleisen - 1988
67 Representing monads - Filinski - 1994
66 Abstracting control - Danvy, Filinski - 1990
47 Information and Computation (context) - Talpin, Jouvelot et al. - 1994
39 A semantics for imprecise exceptions - Jones, Reid et al. - 1999
38 A metalanguage for programming with bound names modulo renam.. - Pitts, Gabbay - 2000
33 Journal of Functional Programming (context) - Talpin, Jouvelot et al. - 1992
28 Run-time code generation and Modal-ML - Wickline, Lee et al. - 1998
27 Lisp and Symbolic Computation (context) - Sitaram, Felleisen et al. - 1990
22 and proof irrelevance in modal type theory (context) - Pfenning, extensionality - 2001
22 Meta-programming with names and necessity - Nanevski - 2002
20 Modal types as staging specifications for run-time code gene.. - Wickline, Lee et al. - 1998
17 Representing layered monads - Filinski - 1999
16 ects and monads (context) - Wadler, of - 1998
15 A functional abstraction of typed contexts - Danvy, Filinski - 1989
12 Lisp and Symbolic Computation (context) - Hieb, Dybvig et al. - 1994
11 Nominal logic: A first order theory of names and binding - Pitts - 2001
11 A constructive formalization of the catch and throw mechanis.. - Nakano - 1992
10 Lisp and Symbolic Computation (context) - Wadler, composable - 1994
10 and pseudo-classical type systems: A-translation at work (context) - Murthy, hierarchies - 1992
7 A simple calculus of exception handling - de Groote - 1995
7 Towards merging recursion and comonads - Pardo - 2000
6 A type-theoretic study on partial continuations - Kameyama - 2000
5 Carnegie Mellon University (context) - Filinski, ects - 1996
4 From dynamic binding to state via modal possibility (context) - Nanevski - 2003
4 Towards logical understanding of delimited continuations - Kameyama - 2000
3 ects with monadic typing (context) - Kieburtz - 1998
3 Strong normalizability non deterministic catchthrow calculi - Sato, of et al. - 2002
2 ects to typed continuation passing (context) - Thielecke - 2003
1 Technical Report IML-R-- 34-00/01--SE (context) - Awodey, Bauer et al. - 2001
1 Available from httpwww (context) - Codata, Haskell et al. - 1999
Documents on the same site (http://reports-archive.adm.cs.cmu.edu/anon/2003/): More
A Type System for Well-Founded Recursion - Dreyer, Harper, Crary (2003) (Correct)
Approximation Schemes for Flow Time on Multiple Machines - Bansal (2003) (Correct)
Protecting Privacy in Key-Value Search Systems - Xie, O'Hallaron, Reiter (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