Discrete Lawvere theories and computational effects
type: Item
instance of: scholarly article
title: Discrete Lawvere theories and computational effects
zbMATH Open document ID: 1112.18006
published in: Theoretical Computer Science
publication date: 2007-01-09T00:00:00Z
review text: Lawvere theories are a category-theoretic formulation of universal algebra for which the notion of operation is primitive. Countable Lawvere theories allow for the modelling of several computational effects in terms of sums, tensors and distributive tensors. The enrichment of a category allows to extend the type of computational effects that can be modelled. For countable Lawvere theories, sums and tensors extend to the enriched version, but distributive tensors do not. In this paper, the authors modify the notion of enriched Lawvere theory, introducing the discrete Lawvere theory, so that it is possible to incorporate an enriched account of the distributive tensor.
Mathematics Subject Classification ID: 18C10
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 18D99
zbMATH DE Number: 5083523
zbMATH Keywords: countable Lawvere V-theory
zbMATH Keywords: discrete Lawvere V-theory
zbMATH Keywords: model
zbMATH Keywords: sum
zbMATH Keywords: tensor
zbMATH Keywords: distributive tensor
zbMATH Keywords: image
author: Martin Hyland
author: John Power
reviewed by: Manuel Ojeda-Aciego
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.07.007
OpenAlex ID: W2044178213
cites work: Q4293501
cites work: Q3682648
cites work: Q3997112
cites work: Two-dimensional monad theory
cites work: Q4362961
cites work: Stable power domains
cites work: The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
cites work: Q3907039
cites work: Combining effects: sum and tensor
cites work: Pseudo-commutative monads and pseudo-closed 2-categories
cites work: Combining algebraic effects with continuations
cites work: Q3203061
cites work: A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
cites work: Q3934579
cites work: Q3324132
cites work: Finite-product-preserving functors, Kan extensions, and strongly-finitary 2-monads
cites work: Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
cites work: Sketches
cites work: Monads on symmetric monoidal closed categories
cites work: Varieties of chain-complete algebras
cites work: Q4536613
cites work: Q3202991
cites work: Notions of computation and monads
cites work: A Powerdomain Construction
cites work: Q2771052
cites work: Q4738236
cites work: Why tricategories?
cites work: Q4704209
cites work: Foundations of Software Science and Computation Structures
cites work: Algebra and Coalgebra in Computer Science
cites work: Q4488202
cites work: Retracted: Semantic domains for combining probability and non-determinism
DOI: 10.1016/J.TCS.2006.07.007
Recommended article: Algebra and Coalgebra in Computer Science
Recommended article: Countable Lawvere theories and computational effects
Recommended article: Q4939149
Recommended article: Q3793110
Recommended article: Q4469703
Recommended article: Q4454968
Recommended article: Dispersive computational continua
Recommended article: Discrete and Continuous Simulation
Recommended article: Q2988063
Recommended article: Q3509937
description: scientific article; zbMATH DE number 5083523