Shapely monads and analytic functors

نویسندگان
چکیده

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

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

منابع مشابه

Shapely monads and analytic functors

In mathematics and computer science, we often encounter structures which are faithfully encoded by a graphical calculus of the following sort. The basic data of the structure are depicted as certain diagrams; the basic operations of the structure act by glueing together these diagrams along certain parts of their boundaries; and the axioms of the structure are just those necessary to ensure tha...

متن کامل

Monads, shapely functors, and traversals

This paper demonstrates the potential for combining the polytypic and monadic programming styles, by introducing a new kind of combinator, called a traversal. The natural setting for defining traversals is the class of shapely data types. This result reinforces the view that shapely data types form a natural domain for polytypism: they include most of the data types of interest, while to exceed...

متن کامل

Polynomial and Analytic Functors and Monads, revisited

We describe an abstract 2-categorical setting to study various notions of polynomial and analytic functors and monads.

متن کامل

Idempotent Monads and *-Functors

For an associative ring R, let P be an R-module with S = EndR(P). C. Menini and A. Orsatti posed the question of when the related functor HomR(P, −) (with left adjoint P ⊗S −) induces an equivalence between a subcategory of R M closed under factor modules and a subcategory of S M closed under submodules. They observed that this is precisely the case if the unit of the adjunction is an epimorphi...

متن کامل

Strong Functors and Monoidal Monads

In [4] we proved that a commutative monad on a symmetric monoidal closed category carries the structure of a symmetric monoidal monad ([4], Theorem 3.2). We here prove the converse, so that, taken together, we have: there is a 1-1 correspondence between commutative monads and symmetric monoidal monads (Theorem 2.3 below). The main computational work needed consists in constructing an equivalenc...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Logic and Computation

سال: 2017

ISSN: 0955-792X,1465-363X

DOI: 10.1093/logcom/exx029