Semantics for algebraic operations

Electronic Notes in Theoretical Computer Science

Volumn 45, Issue , 2001, Pages 332-345

  Plotkin, Gordon ^a   Power, John ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL OPERATORS; PROBABILISTIC LOGICS; SEMANTICS; THEOREM PROVING;

ALGEBRAIC OPERATIONS; AXIOMS; MONADS; UNIVERSAL ALGEBRA;

ALGEBRA;

EID: 18944366122     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80970-8     Document Type: Conference Paper

References (13)

1. Anderson S.O., Power A.J. A Representable Approach to Finite Nondeterminism. Theoret. Comput. Sci. 177:1997;3-25
2. Jones C., "Probabilistic Non-Determinism," Ph.D. Thesis, University of Edinburgh, Report ECS-LFCS-90-105, 1990.
3. Jones C., Plotkin G.D. A Probabilistic Powerdomain of Evaluations. Proc. LICS. 4:1989;186-195
4. Kelly G.M. "Basic Concepts of Enriched Category Theory," 1982;Cambridge University Press, Cambridge
5. Levy, P.B., Call-by-Push-Value: A Subsuming Paradigm, "Proc. TLCA 99" Lecture Notes in Computer Science 1581 228-242
6. Moggi E. Computational lambda-calculus and monads. Proc. LICS. 89:1989;14-23
7. Moggi E., An abstract view of programming languages, University of Edinburgh, Report ECS-LFCS-90-113, 1989.
8. Moggi E. Notions of computation and monads. Inf. and Comp. 93:1991;55-92
9. Plotkin G.D. A Powerdomain Construction. SIAM J. Comput. 5:1976;452-487
10. Plotkin, G.D., "Domains," (http://www.dcs.ed.ac.uk/home/gdp/), 1983.
11. Plotkin, G.D., and A. J. Power, Adequacy for Algebraic Effects, Proc. FOSSACS 2001 (to appear).
12. Power A.J. Enriched Lawvere Theories. Theory and Applications of Categories. 2000;83-93
13. Power A.J., Robinson E.P. Modularity and Dyads. "Proc. MFPS 15" Electronic Notes in Thoeret. Comp. Sci. 20:1999