Adjunctions and comonads in differential algebra
نویسندگان
چکیده
منابع مشابه
Signals and Comonads
We propose a novel discipline for programming stream functions and for the semantic description of stream manipulation languages based on the observation that both general and causal stream functions can be characterized as coKleisli arrows of comonads. This seems to be a promising application for the old, but very little exploited idea that if monads abstract notions of computation of a value,...
متن کاملComonads and Galois Corings
The notion of a coring was introduced by M. E. Sweedler in [20] with the objective of formulating and proving a predual to the Jacobson-Bourbaki theorem for extensions of division rings. A fundamental argument in [20] is the following: given division rings E ⊆ A, each coideal J of the A–coring A ⊗E A gives rise to a factor coring C = A ⊗E A/J . If g ∈ C denotes the group-like element 1 ⊗E 1 + J...
متن کاملCategory Theoretic Understandings of Universal Algebra and its Dual: Monads and Lawvere Theories, Comonads and What?
Universal algebra is often known within computer science in the guise of algebraic specification or equational logic. In 1963, it was given a category theoretic characterisation in terms of what are now called Lawvere theories. Unlike operations and equations, a Lawvere theory is uniquely determined by its category of models. Except for a caveat about nullary operations, the notion of Lawvere t...
متن کاملCategories Enriched over a Quantaloid: Isbell Adjunctions and Kan Adjunctions
Each distributor between categories enriched over a small quantaloid Q gives rise to two adjunctions between the categories of contravariant and covariant presheaves, and hence to two monads. These two adjunctions are respectively generalizations of Isbell adjunctions and Kan extensions in category theory. It is proved that these two processes are functorial with infomorphisms playing as morphi...
متن کاملCodata and Comonads in Haskell
Haskell, a wide spectrum, functional programming language, provides means to de ne and use an extremely rich variety of data including free, polymorphic datatypes, type classes, and data with additional computational structure abstracted by monads. Somewhat less attention has been given to supporting abstract data types, which we shall call codata types. Monomorphic, parameterless versions of c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1975
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1975.59.99