See this document in CiteSeerX!

Combining Effects: Sum and Tensor  (Make Corrections)  
Martin Hyland, Gordon Plotkin, John Power



  Home/Search   Context   Related

 
View or download:
homepages.inf.ed.a...mb_Effects_Jour.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  homepages.inf.ed.ac.uk/gdp/pub... (more)
Homepages:  G.Plotkin  

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We seek a unified account of modularity for computational effects. We begin by reformulating Moggi's monadic paradigm for modelling computational effects using the notion of enriched Lawvere theory, together with its relationship with strong monads; this emphasises the importance of the operations that produce the effects. Effects qua theories are then combined by appropriate bifunctors on the category of theories. We give a theory for the sum of computational effects, which in particular... (Update)

Similar documents (at the sentence level):
5.0%:   Combining Computational Effects: Commutativity and Sum - Hyland, Plotkin, Power (2002)   (Correct)

Active bibliography (related documents):   More   All
1.3:   Computational Effects and Operations: An Overview - Plotkin, Power (2002)   (Correct)
1.0:   Combining Continuations with Other Effects - Hyland, Levy, Plotkin, Power   (Correct)
0.7:   Adequacy for Algebraic Effects - Plotkin, Power (2001)   (Correct)

Similar documents based on text:   More   All
0.1:   Lax Logical Relations - Plotkin, Power, Sannella, Tennent (2000)   (Correct)
0.1:   Notions of Computation Determine Monads - Plotkin, Power (2002)   (Correct)
0.1:   An Extended Calculus of Constructions - Luo (1990)   (Correct)

BibTeX entry:   (Update)

@misc{ hyland-combining,
  author = "Martin Hyland and Gordon Plotkin and John Power",
  title = "Combining Effects: Sum and Tensor",
  url = "citeseer.ist.psu.edu/720831.html" }
Citations (may not include all citations):
299   Algebraic Theory of Processes (context) - Hennessy - 1988
291   Computational Lambda-Calculus and Monads - Moggi - 1989
232   Category Theory for Computing Science (context) - Barr, Wells - 1990
156   Basic Concepts of Enriched Category Theory (context) - Kelly - 1982
146   A Powerdomain Construction (context) - Plotkin - 1976
108   Introduction to Functional Programming Using Haskell (context) - Bird - 1998
93   A Probabilistic Powerdomain of Evaluations (context) - Jones, Plotkin - 1989
87   Notions of Computation and Monads - Moggi - 1991
84   A Domain Equation for Bisimulation (context) - Abramsky - 1991
83   Probabilistic Non-Determinism (context) - Jones - 1990
77   Full Abstraction for a Simple Parallel Programming Language (context) - Hennessy, Plotkin - 1979
72   An Abstract View of Programming Languages (context) - Moggi - 1989
69   Triples and Theories (context) - Barr, Wells - 1985
63   URL httpwww (context) - URL, dcs et al. - 1983
36   Concurrent Processes and Their Syntax (context) - Milne, Milner - 1979
31   The Formal Theory of Monads (context) - Street - 1972
28   Adjunctions whose Counits are Coequalizers (context) - Kelly, Power - 1993
23   Monads on Symmetric Monoidal Closed Categories (context) - Kock - 1970
19   A Syntactic Approach to Modularity in Denotational Semantics - Cenciarelli, Moggi - 1993
17   Representing Layered Monads - Filinski - 1999
16   Graduate Texts in Mathematics (context) - Manes, Theories - 1976
14   Complete Axioms for Categorical Fixed-Point Operators - Simpson, Plotkin - 2000
14   Variations on Algebra: Monadicity and Generalisations of Equ.. - Robinson - 2002
11   Nondeterminism and Probabilistic Choice: Obeying the Laws - Mislove - 2000
10   From Algol to Polymorphic Linear LambdaCalculus (context) - O'Hearn, Reynolds - 2000
10   Algebra-Valued Functors in General and Tensor Products in Pa.. (context) - Freyd - 1966
10   Notions of Computation Determine Monads - Plotkin, Power - 2002
10   Probabilistic Domains - Heckmann - 1994
9   Semantics for Algebraic Operations - Plotkin, Power - 2001
9   Springer-Verlag (context) - Schubert - 1972
8   New York: Prentice Hall (context) - Milner, Concurrency - 1989
7   Accomplishments and Open Problems (context) - Fiore, Jung et al. - 1996
7   Monads and E ects (context) - Benton, Hughes et al. - 2000
7   Modularity in Denotational Semantics (context) - Power - 1997
6   Adequacy for Algebraic E ects - Plotkin, Power - 2001
6   Wellfounded Trees in Categories - Moerdijk, Palmgren - 2000
6   Modularity and Dyads (context) - Power, Robinson - 1999
5   Why Tricategories (context) - Power - 1995
5   Two-Dimensional Linear Algebra (context) - Hyland, Power - 2001
5   A Modular Approach to Denotational Semantics (context) - Power, Rosolini - 1998
5   Pure Appl (context) - Kinoshita, Power et al. - 1999
5   Glasgow Workshop on Functional Programming (context) - King, Wadler et al. - 1992
5   Continuous Lattices and Domains (context) - Gierz, Hofmann et al. - 2003
4   London Mathematical Society Lecture Note Series (context) - Ad, Rosick et al. - 1994
4   Technical Report YALEUDCRR (context) - Duponcheel, Technical et al. - 1993
3   Pseudo-Commutative Monads (context) - Hyland, Power - 2001
3   Applied Categorical Structures (context) - Plotkin, Power et al. - 2003
3   Pseudo-Commutative Monads and PseudoClosed 2-Categories (context) - Hyland, Power - 2002
3   Theory and Applications of Categories (context) - Power, Theories - 2000
3   Powerdomains and Fully Abstract Models for Applicative Multi.. (context) - Abramsky - 1983
3   A Uni ed Treatment of Trans nite Constructions for Free Alge.. (context) - Kelly - 1980
1   Aspects of Positivity in Functional Analysis (context) - onig, Applications et al. - 1986
1   A Universal Notion of the Real Interval (context) - Escard, Simpson
1   Structures De ned by Finite Limits in the Enriched Context (context) - Kelly - 1982
1   Wellfounded Trees and Dependent Polynomial Functors (context) - Gambino, Hyland - 2004

Documents on the same site (http://homepages.inf.ed.ac.uk/gdp/publications/):   More
Full Abstraction, Totality and PCF - Plotkin (1997)   (Correct)
Subtyping and Parametricity - Plotkin, Abadi, Cardelli (1993)   (Correct)
Complete Axioms for Categorical Fixed-point Operators - Simpson, Plotkin (2000)   (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