Nick Benton, John Hughes, Eugenio Moggi  Home/Search
Context Related
| cs.chalmers.se/~rjmh/Papers/BHM.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: cs.chalmers.se/~rjmh/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A tension in language design has been between simple semantics on the one hand, and rich possibilities for side-effects, exception handling and so on on the other. The introduction of monads has made a large step towards reconciling these alternatives. First proposed by Moggi as a way of structuring semantic descriptions, they were adopted by Wadler to structure Haskell programs, and now offer a general technique for delimiting the scope of effects, thus reconciling referential... (Update)
Cited by: More
Reusable Monadic Semantics of Object Oriented Programming.. - Gayo, Lovelle, Diez, Rio (Correct)
Active bibliography (related documents): More All
3.5: Monads and Effects (revised) - Benton, Hughes, Moggi (2000) (Correct)
0.4: The Marriage of Effects and Monads - Wadler, Thiemann (1998) (Correct)
0.3: A Modal Language for Effects - Park, Harper (2004) (Correct)
Similar documents based on text: More All
0.4: Linear Logic, Monads, and the Lambda Calculus - Benton, Wadler (1995) (Correct)
0.4: Structuring Functional Programs By Using Monads - Obradovic (1998) (Correct)
0.4: Monads and Composable Continuations - Wadler (1993) (Correct)
BibTeX entry: (Update)
N. Benton, J. Hughes, and E. Moggi. Monads and effects. In International Summer School On Applied Semantics APPSEM'2000, Caminha, Portugal, 2000. http://citeseer.ist.psu.edu/article/benton00monad.html More
@unpublished{ benton00monads,
author = "Nick Benton and John Hughes and Eugenio Moggi",
title = "Monads and Effects",
year = "2000",
url = "citeseer.ist.psu.edu/article/benton00monad.html" }
Citations (may not include all citations):521 Compiling with Continuations (context) - Appel - 1992
369 Information and Computation (context) - Moggi, computation - 1991
306 A syntactic approach to type soundness - Wright, Felleisen - 1994
306 LCF considered as a programming language (context) - Plotkin - 1977
291 Computational lambda-calculus and monads - Moggi - 1989
244 Imperative functional programming - Jones, Wadler - 1993
220 Orbit: An optimizing compiler for Scheme (context) - Kranz, Kelsey et al. - 1986
188 Region-based memory management - Tofte, Talpin - 1997
181 Principles of Program Analysis (context) - Nielson, Hielson et al. - 1999
158 Reasoning about programs in continuation-passing style - Sabry, Felleisen - 1993
155 The essence of compiling with continuations - Flanagan, Sabry et al. - 1993
138 Typed closure conversion - Minamide, Morrisett et al. - 1996
120 Monad transformers and modular interpreters - Liang, Hudak et al. - 1995
101 Lazy functional state threads - Launchbury, Jones - 1994
94 Mathematical Structures in Computer Science (context) - Wadler - 1992
93 Principles of programming with complex objects and collectio.. - Buneman, Naqvi et al. - 1995
87 call-by-value and the lambda calculus (context) - Plotkin - 1975
87 Operational Semantics and Polymorphic Type Inference (context) - Tofte - 1987
84 Denotational Description of Programming Languages (context) - Gordon - 1979
79 ACM Transactions on Programming Languages and Systems (context) - Morrisett, Walker et al. - 1999
73 Denotational semantics (context) - Mosses - 1990
69 Triples and Theories (context) - Barr, Wells - 1985
67 Recursive Programming Techniques (context) - Burge - 1975
65 Equivalences in functional languages with effects - Mason, Talcott - 1991
58 Simple imperative polymorphism - Wright - 1995
57 Compiling Standard ML to Java bytecodes - Benton, Kennedy et al. - 1998
50 Compiling Haskell by program transformation: A report from t.. - Jones - 1996
48 Operationally-based theories of program equivalence - Pitts - 1997
43 An overview of the FLINT/ML compiler - Shao - 1997
41 Polymorphic type inference and assignment - Leroy, Weis - 1991
37 A generic account of continuation-passing styles - Hatcliff, Danvy - 1994
36 Categorical logic - Pitts - 2000
35 CPS transformation after strictness analysis - Danvy, Hatcliff - 1993
34 Uniqueness typing for functional languages with graph rewrit.. - Barendsen, Smetsers - 1996
33 Modular denotational semantics for compiler construction - Liang, Hudak - 1996
31 Names and Higher Order Functions - Stark - 1994
29 Integrating functional and imperative programming (context) - Gifford, Lucassen - 1986
29 Modular domain specific languages and tools - Hudak - 1998
28 Number 26 in Cambridge Tracts in Theoretical Computer Scienc.. (context) - Mosses - 1992
25 MIT Laboratory for Computer Science (context) - Gifford, Jouvelot et al. - 1987
24 Strictness Analysis of Lazy Functional Programs (context) - Benton - 1992
21 Proving the correctness of compiler optimisations based on a.. - Burn, Le Metayer - 1992
19 A syntactic approach to modularity in denotational semantics - Cenciarelli, Moggi - 1993
19 Monadic parsing in haskell - Hutton, Meijer - 1998
17 The elimination theorem when modality is present (context) - Curry - 1957
17 Representing layered monads - Filinski - 1999
16 Structuring depth-first search algorithms in haskell - King, Launchbury - 1995
16 Graduate Texts in Mathematics (context) - Manes - 1976
16 Bridging the gulf: A common intermediate language for ML and.. - Jones, Launchbury et al. - 1998
16 Number 141 in Studies in Logic and the Foundations of Mathem.. (context) - Jacobs, Type - 1999
15 Monadic encapsulation in ML - Semmelroth, Sabry - 1999
15 A type-theoretic alternative to CUCH (context) - Scott - 1993
15 Call-by-push-value: a subsuming paradigm - Levy - 1999
14 The marriage of effects and monads - Wadler - 1998
13 Metalanguages and applications - Moggi - 1997
11 A semantics for evaluation logic (context) - Moggi - 1995
9 Optimizing ML using a hierarchy of monadic types - Tolmach - 1998
9 Number 7 in Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
7 A functional represention of data structures with a hole (context) - Minamide - 1998
6 Monadic encapsulation of effects: A revised approach - Moggi, Palumbo - 1999
4 effects and transformations (context) - Benton, Kennedy - 1999
3 Handbook of Categorial Algebra (context) - Borceux - 1994
3 Implementing collection classes with monads (context) - Manes - 1998
2 Monadic state: Axiomatisation and type safety (context) - Launchbury, Sabry - 1997
1 Exceptional syntax (context) - Benton, Kennedy - 2000
Documents on the same site (http://www.cs.chalmers.se/~rjmh/): More
Generalising Monads to Arrows - Hughes (1998) (Correct)
Implementing Projection-based Strictness Analysis - Kubiak, Hughes, Launchbury (1992) (Correct)
Fast Abstract Interpretation Using Sequential Algorithms - Ferguson, Hughes (1993) (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