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 alternative formulations of Freyd category that are equivalent to Arrows—enriched Freyd categories and indexed Freyd categories. By imposing a further condition, we characterise those indexed Freyd categories that are isomorphic to Freyd categories. The key differentiating point is the number of inputs available to a computation and the structure available ...
Category theory has been developed over the last 50 years as a multi-level mathematical workspace ca...
We prove that the arrow category of a monoidal model category, equipped with the pushout product mon...
Computations on trees form a classical topic in computing. These computations can be described in te...
AbstractWe investigate what the correct categorical formulation of Hughesʼ Arrows should be. It has ...
We investigate what the correct categorical formulation of Hughes’ Arrows should be. It has long bee...
Arrows are an extension of the well-established notion of a monad in functional-programming language...
AbstractMonads are by now well-established as programming construct in functional languages. Recentl...
AbstractThe notion of arrow by Hughes is an axiomatization of the algebraic structure possessed by s...
Arrows involving a loop operator provide an interesting programming methodology for looping computat...
AbstractWe revisit the connection between three notions of computation: Moggiʼs monads, Hughesʼs arr...
Using of category theory in computer science has extremely grown in the last decade. Categories allo...
International audienceMost often, in a categorical semantics for a programming language, the substit...
We revisit the connection between three notions of computation: Moggi’s monads, Hughes’s arrows and ...
Arrows illustrate a large variety of semantics in diagrams. An automated interpretation of arrows wo...
Computations on trees form a classical topic in computing. These computations can be described in te...
Category theory has been developed over the last 50 years as a multi-level mathematical workspace ca...
We prove that the arrow category of a monoidal model category, equipped with the pushout product mon...
Computations on trees form a classical topic in computing. These computations can be described in te...
AbstractWe investigate what the correct categorical formulation of Hughesʼ Arrows should be. It has ...
We investigate what the correct categorical formulation of Hughes’ Arrows should be. It has long bee...
Arrows are an extension of the well-established notion of a monad in functional-programming language...
AbstractMonads are by now well-established as programming construct in functional languages. Recentl...
AbstractThe notion of arrow by Hughes is an axiomatization of the algebraic structure possessed by s...
Arrows involving a loop operator provide an interesting programming methodology for looping computat...
AbstractWe revisit the connection between three notions of computation: Moggiʼs monads, Hughesʼs arr...
Using of category theory in computer science has extremely grown in the last decade. Categories allo...
International audienceMost often, in a categorical semantics for a programming language, the substit...
We revisit the connection between three notions of computation: Moggi’s monads, Hughes’s arrows and ...
Arrows illustrate a large variety of semantics in diagrams. An automated interpretation of arrows wo...
Computations on trees form a classical topic in computing. These computations can be described in te...
Category theory has been developed over the last 50 years as a multi-level mathematical workspace ca...
We prove that the arrow category of a monoidal model category, equipped with the pushout product mon...
Computations on trees form a classical topic in computing. These computations can be described in te...