Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
S
sgdt
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
gradual-typing
sgdt
Commits
71db74fa
Commit
71db74fa
authored
7 years ago
by
Max New
Browse files
Options
Downloads
Patches
Plain Diff
definition of freyd multicategory (with specified central morphisms)
parent
aa1f3d62
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
sketch.org
+34
-0
34 additions, 0 deletions
sketch.org
with
34 additions
and
0 deletions
sketch.org
0 → 100644
+
34
−
0
View file @
71db74fa
* Freyd Multicategories as Generalized Multicategories
(Based on Discussion with Mike Shulman about Premonoidal Categories)
First, there is a double category of Subset Matrices whose objects are
sets, vertical arrows are functions, horizontal arrows $R : A -/-> B$
are for each a,b a set $R_l(a,b)$ with a specified subset $R_t(a,b)
\subset R_l(a,b)$. A monoid in this double category is an M-category
or a pure-effectful category which has a set of objects, for each pair
of objects a set of "loose arrows" which are "possibly effectful", a
subset of "tight arrows" which are "pure" such that any composable
string of tight arrows is tight (including empty string, i.e. the
identity).
There is a "funny cartesian" monoidal product called □ and defined by
generators and relations as follows. $C □ D$ has as objects pairs
(c,d) of objects. Arrows are generated by for each arrow $f : c -> c'$
and object d in D, there is an arrow $f □ id$ and vice-versa for
arrows in D. Subject to the following equations:
(f □ id) o (f' □ id) = (f o f' □ id)
(id □ g) o (id □ g') = (id □ g o g')
(p □ id) o (id □ g) = (id □ g) o (p □ id)
(id □ q) o (f □ id) = (f □ id) o (id □ q)
where p,q are tight morphisms.
The monoids with respect to □ are strict premonoidal categories with a
specified subset of the central morphisms.
Restricted to tight arrows, it is the cartesian produt.
There should be a free monoid monad T on M-category, and then "freyd
multicategories" should be T-multicategories.
These have a set C0 of objects, for every list of objects G and object
A a set of loose morphisms C_l(G;A) with a specified subset of tight
morphisms
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment