Freyd categories are Enriched Lawvere Theories

نویسنده

  • Sam Staton
چکیده

Lawvere theories provide a categorical formulation of the algebraic theories from universal algebra. Freyd categories are categorical models of first-order effectful programming languages. The notion of sound limit doctrine has been used to classify accessible categories. We provide a definition of Lawvere theory that is enriched in a closed category that is locally presentable with respect to a sound limit doctrine. For the doctrine of finite limits, we recover Power’s enriched Lawvere theories. For the empty limit doctrine, our Lawvere theories are Freyd categories, and for the doctrine of finite products, our Lawvere theories are distributive Freyd categories. In this sense, computational effects are algebraic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generic models for computational effects

AFreyd-category is a subtle generalisation of the notion of a categorywith finite products. It is suitable formodelling environments in call-by-value programming languages, such as the computational -calculus, with computational effects.We develop the theory of Freyd-categorieswith that inmind.Wefirst show that any countable Lawvere theory, hence any signature of operationswith countable arity ...

متن کامل

Gabriel-Ulmer duality and Lawvere theories enriched over a general base

Motivated by the search for a body of mathematical theory to support the semantics of computational effects, we first recall the relationship between Lawvere theories and monads on Set. We generalise that relationship from Set to an arbitrary locally presentable category such as Poset, ωCpo, or functor categories such as [Inj, Set] or [Inj, ωCpo]. That involves allowing the arities of Lawvere t...

متن کامل

Theories

We consider the equivalence of Lawvere theories and finitary monads on Set from the perspective of Endf (Set)-enriched category theory, where Endf (Set) is the category of finitary endofunctors of Set. We identify finitary monads with one-object Endf (Set)-categories, and ordinary categories admitting finite powers (i.e., n-fold products of each object with itself) with Endf (Set)-categories ad...

متن کامل

Discrete Lawvere theories and computational effects

Countable Lawvere theories model computational effects such as exceptions, side-effects, interactive input/output, nondeterminism and probabilistic nondeterminism. The category of countable Lawvere theories has sums, tensors, and distributive tensors, modelling natural combinations of such effects. It is also closed under taking images. Enrichment in a category such as Cpo allows one to extend ...

متن کامل

Enriched algebraic theories and monads for a system of arities

Under a minimum of assumptions, we develop in generality the basic theory of universal algebra in a symmetric monoidal closed category V with respect to a specified system of arities j : J ↪→ V . Lawvere’s notion of algebraic theory generalizes to this context, resulting in the notion of single-sorted V -enriched J -cotensor theory, or J -theory for short. For suitable choices of V and J , such...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 303  شماره 

صفحات  -

تاریخ انتشار 2014