Cartesian effect categories are Freyd-categories

نویسندگان

  • Jean-Guillaume Dumas
  • Dominique Duval
  • Jean-Claude Reynaud
چکیده

Most often, in a categorical semantics for a programming language, the substitution of terms is expressed by composition and finite products. However this does not deal with the order of evaluation of arguments, which may have major consequences when there are side-effects. In this paper Cartesian effect categories are introduced for solving this issue, and they are compared with strong monads, Freydcategories and Haskell’s Arrows. It is proved that a Cartesian effect category is a Freyd-category where the premonoidal structure is provided by a kind of binary product, called the sequential product. The universal property of the sequential product provides Cartesian effect categories with a powerful tool for constructions and proofs. To our knowledge, both effect categories and sequential products are new notions.

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

ثبت نام

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

منابع مشابه

Closed Freyd- and -categories

We give two classes of sound and complete models for the computational-calculus, or c-calculus. For the rst, we generalise the notion of cartesian closed category to that of closed Freyd-category. For the second, we generalise simple indexed categories. The former gives a direct semantics for the computational-calculus. The latter corresponds to an idealisation of stack-based intermediate langu...

متن کامل

Modelling environments in call-by-value programming languages

In categorical semantics, there have traditionally been two approaches to modelling environments, one by use of finite products in cartesian closed categories, the other by use of the base categories of indexed categories with structure. Each requires modifications in order to account for environments in call-by-value programming languages. There have been two more general definitions along bot...

متن کامل

What is a Categorical Model of Arrows?

We investigate what the correct categorical formulation of Hughes’ Arrows should be. It has long been folklore that Arrows, a functional programming construct, and Freyd categories, a categorical notion due to Power, Robinson and Thielecke, are somehow equivalent. In this paper, we show that the situation is more subtle. By considering Arrows wholly within the base category we derive two altern...

متن کامل

Freyd categories are Enriched Lawvere Theories

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 ...

متن کامل

Traced pre-monoidal categories

Motivated by some examples from functional programming, we propose a generalisation of the notion of trace to symmetric premonoidal categories and of Conway operators to Freyd categories. We show that, in a Freyd category, these notions are equivalent, generalising a well-known theorem of Hasegawa and Hyland.

متن کامل

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


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

عنوان ژورنال:
  • J. Symb. Comput.

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2011