Skip to main content

All Questions

Filter by
Sorted by
Tagged with
6 votes
1 answer
138 views

Condition for a functor to induce a cartesian closed functor between categories of presheaves

We denote the category of presheaves on a small category ${\cal C}$ (set-valued functor-category) by $$\widehat{\cal C}:=[{\cal C}^{op},{\bf Set}].$$ Such a category is cartesian closed, i.e. it ...
8 votes
0 answers
370 views

An obscure case of Curry-Howard

It is a theorem of the Intuitionistic Propositional Calculus that $$ (p\to q)\to p = (q\to p) \land ((p\to q)\to q). $$ The Curry-Howard correspondence realizes this as a pair of operators (for any ...
3 votes
0 answers
54 views

A new(?) kind of 2-adjunction for relating cartesian closed functors using dinatural hexagons

$\newcommand{\A}{\operatorname{A}} \newcommand{\B}{\operatorname{B}} \newcommand{\Cat}{\mathcal{Cat}} \newcommand{\Cart}{\mathcal{Cart}} \newcommand{\C}{\mathbf{C}} \newcommand{\F}{\operatorname{F}} \...
2 votes
0 answers
19 views

Reference request for dinatural transformations arising from free Cartesian closed categories

Let $g_n$ be a discrete graph with $n$ nodes and $\operatorname{F}$ the free functor of the adjunction between the category of graphs and the category of Cartesian closed categories and functors, as ...
1 vote
0 answers
22 views

Are the categories of definable dinatural transformations freely generated from discrete graphs?

It is well known that the dinatural transformations between multivariant functors defined in Functorial polymorphism don't form a category, because they do not compose in general, but some do. For any ...
1 vote
0 answers
32 views

Any papers on the Lambek graph-$\lambda$ calculus-adjunction and the semantics of the Hindley Milner type system?

Joachim Lambek has described an adjunction between the category of graphs and the category of positive intuitionistic calculi with iteration, see e. g. Introduction to Higher Order Categorical Logic ...
3 votes
1 answer
140 views

Where can I learn about Cartesian closed functors between categories of simply typed lambda calculus?

I'll try to describe the subject I am looking for literature on, or concept names that I can Google. For each $n \geq 1$, let $\mathbf{STLC}_n$ be the category where the objects are all simply typed ...
8 votes
2 answers
551 views

Mention of Bernoulli principle by Bill Lawvere

In the Author Commentary to the reprint of the paper paper Diagonal Arguments and Cartesian Closed Categories in Theory and Applications of Categories Bill Lawvere wrote: Although the cartesian-...
2 votes
0 answers
92 views

Group ring objects in a Cartesian closed category

Let $\mathcal{C}$ be a Cartesian closed category, with $R$ a ring object in $\mathcal{C}$ and $G$ a group object in $\mathcal{C}$. Is there literature on the notion of the 'group ring object' $R^G$? ...
17 votes
4 answers
1k views

What is the monoidal equivalent of a locally cartesian closed category?

If a closed monoidal category is the monoidal equivalent of a Cartesian closed category, is there an analogous equivalent for locally cartesian closed categories? Is there a standard terminology or ...
10 votes
1 answer
215 views

Weak colimits in locally cartesian closed categories

The general adjoint functor theorem implies that a complete locally small category has a weak colimit of a diagram if and only if it has a colimit of this diagram. It seems that this is also true for ...
2 votes
1 answer
327 views

Substructural types, the lambda calculus, and CCCs

It's well known that the simply-typed lambda calculus corresponds to a cartesian closed category. How would substructural type systems be characterized in category theory? For example, linear type ...