登入選單
返回Google圖書搜尋
出版Oxford University Computing Laboratory, Programming Research Group, 1989
URLhttp://books.google.com.hk/books?id=nQ2NPgAACAAJ&hl=&source=gbs_api
註釋Abstract: "This paper presents indexed categories, which model uniformly defined families of categories, and suggests that they are a useful tool for the working computer scientist. An indexed category gives rise to a single flattened category as a disjoint union of its component categories plus some additional morphisms. Similarly, an indexed functor (which is a uniform family of functors between the component categories) induces a flattened functor between the corresponding flattened categories. Under certain assumptions, flattened categories are (co)complete if all their components are, and flattened functors have left adjoints if all their components do.