Research

Countable Lawvere Theories and Computational Effects


Reference:

Power, J., 2006. Countable Lawvere Theories and Computational Effects. Electronic Notes in Theoretical Computer Science, 161, pp. 59-71.

Related documents:

This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.

Official URL:

http://dx.doi.org/10.1016/j.entcs.2006.04.025

Abstract

previous termLawverenext termprevious termtheoriesnext term have been one of the two main category theoretic formulations of universal algebra, the other being monads. Monads have appeared extensively over the past fifteen years in the theoretical computer science literature, specifically in connection with computational effects, but previous termLawverenext termprevious termtheoriesnext term have not. So we define the notion of (previous termcountablenext term) previous termLawverenext termprevious termtheorynext term and give a precise statement of its relationship with the notion of monad on the category Set. We illustrate with examples arising from the study of computational effects, explaining how the notion of previous termLawverenext termprevious termtheorynext term keeps one closer to computational practice. We then describe constructions that one can make with previous termLawverenext termprevious termtheoriesnext term, notably sum, tensor, and distributive tensor, reflecting the ways in which the various computational effects are usually combined, thus giving denotational semantics for the combinations.

Details

Item Type Articles
CreatorsPower, J.
DOI10.1016/j.entcs.2006.04.025
DepartmentsFaculty of Science > Computer Science
RefereedYes
StatusPublished
ID Code26513

Export

Actions (login required)

View Item