Gordon Plotkin, John Power  Home/Search
Context
Related
| dcs.ed.ac.uk/home/...p_Sem_Comp_Lam.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: dcs.ed.ac.uk/home/gdp/publ...pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Moggi proposed a monadic account of computational e#ects. He also presented the computational #-calculus, #c , a core call-by-value functional programming language for e#ects; the e#ects are obtained by adding appropriate operations. The question arises as to whether one can give a corresponding treatment of operational semantics. We do this in the case of algebraic e#ects where the operations are given by a single-sorted algebraic signature, and their semantics is supported by the monad, in... (Update)
Similar documents (at the sentence level):
55.1%: Adequacy for Algebraic Effects - Plotkin, Power (2001) (Correct)
Active bibliography (related documents): More All
0.7: Combining Effects: Sum and Tensor - Hyland, Plotkin, Power (Correct)
0.7: Combining Computational Effects: Commutativity and Sum - Hyland, Plotkin, Power (2002) (Correct)
0.4: Semantics for Algebraic Operations - Plotkin, Power (2001) (Correct)
Similar documents based on text: More All
0.3: Algebraic Operations and Generic Effects - Plotkin, Power (Correct)
0.2: Notions of Computation Determine Monads - Plotkin, Power (2002) (Correct)
0.2: A Reflection on Call-by-Value - Sabry, Wadler (1996) (Correct)
BibTeX entry: (Update)
@article{ plotkin01adequacy,
author = "Gordon Plotkin and John Power",
title = "Adequacy for Algebraic Effects",
journal = "Lecture Notes in Computer Science",
volume = "2030",
pages = "1--??",
year = "2001",
url = "citeseer.ist.psu.edu/385168.html" }
Citations (may not include all citations):291 Computational lambda-calculus and monads - Moggi - 1989
211 Domain Theory - Abramsky, Jung - 1994
194 The Formal Semantics of Programming Languages (context) - Winskel - 1993
156 Basic Concepts of Enriched Category Theory (context) - Kelly - 1982
146 A Powerdomain Construction (context) - Plotkin - 1976
87 Notions of computation and monads - Moggi - 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
67 Towards a Mathematical Operational Semantics - Turi, Plotkin - 1997
26 Domain Equations for Probabilistic Processes - Baier, Kwiatkowska - 2000
23 and the Lambda-Calculus (context) - Felleisen, Friedman et al. - 1986
19 A Mathematical Semantics for a Nondeterministic Typed Lambda.. (context) - Hennessy, Ashcroft - 1980
19 A Syntactic Approach to Modularity in Denotational Semantics - Cenciarelli, Moggi - 1993
15 Call-by-Push-Value: A Subsuming Paradigm - Levy - 1999
14 The Semantics of Call-By-Value and Call-By-Name in a Nondete.. (context) - Hennessy - 1980
14 Call-by-Value and Nondeterminism (context) - Sieber - 1993
14 Nondeterminism and Fully Abstract Models (context) - Astesiano, Costa - 1980
12 Computational Adequacy in an Elementary Topos - Simpson - 1999
11 Nondeterminism and Probabilistic Choice: Obeying the Laws - Mislove - 2000
10 A Representable Approach to Finite Nondeterminism (context) - Anderson, Power - 1997
10 The Troublesome Probabilistic Powerdomain - Jung, Tix - 1998
9 A Fully Abstract Game Semantics for Finite Nondeterminism - Harmer, McCusker - 1999
8 Probabilistic Game Semantics - Danos, Harmer - 2000
7 Modularity in Denotational Semantics (context) - Power - 1997
6 Modularity and Dyads (context) - Power, Robinson - 1999
5 A Modular Approach to Denotational Semantics (context) - Power, Rosolini - 1998
2 Data Refinement for Call by Value Languages (context) - Kinoshita, Power - 2000
2 Berlin: Springer-Verlag (context) - Guessarian, Semantics et al. - 1981
1 A Probabilistic Powerdomain of Evauations (context) - Jones, Plotkin - 1989
1 reyd- and #-categories (context) - Power, Thielecke - 1999
Documents on the same site (http://www.dcs.ed.ac.uk/home/gdp/publications/pubs.html): More
An Axiomatisation of Computationally Adequate Domain.. - Fiore, Plotkin (1994) (Correct)
Uncountable Limits and the Lambda Calculus - Di GIANANTONIO, al. (1995) (Correct)
On a Question of Friedman - Plotkin (1995) (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