It looks like you're new here. If you want to get involved, click one of these buttons!

- All Categories 2.3K
- Chat 498
- Study Groups 16
- Petri Nets 7
- Epidemiology 3
- Leaf Modeling 1
- Review Sections 9
- MIT 2020: Programming with Categories 52
- MIT 2020: Lectures 21
- MIT 2020: Exercises 25
- MIT 2019: Applied Category Theory 339
- MIT 2019: Lectures 79
- MIT 2019: Exercises 149
- MIT 2019: Chat 50
- UCR ACT Seminar 4
- General 65
- Azimuth Code Project 110
- Statistical methods 2
- Drafts 2
- Math Syntax Demos 15
- Wiki - Latest Changes 3
- Strategy 113
- Azimuth Project 1.1K
- - Spam 1
- News and Information 147
- Azimuth Blog 149
- - Conventions and Policies 21
- - Questions 43
- Azimuth Wiki 707

Options

A lot of what I am doing is related to AQL. https://github.com/CategoricalData/fql

I am developing a language for expressing categories and category families. The specific sub goals are:

Data model [category] migration and integration. A data model is an instance of a schema [which are categories].

Identify/Develop a categorical language using computational data structures. In particular I am doing this in Clojure.

Publish categories This builds on David Spivak's idea of published ologs. https://johncarlosbaez.wordpress.com/2015/03/27/spivak-part-1/ Specifically I have a github repository. https://github.com/babeloff/categories

Investigate visualizers, editors and other interpreters. Too many to call out, but I am currently reevaluating the https://webgme.org/ tooling concepts in categorical terms. The main GME concepts are: containment, inheritance, sets, pointers, class-diagrams, and rules. We have two versions of GME, a C++ .Net desktop version and a javascript browser version. Presently these two versions have similar but distinct data-models.

## Comments

Hi! Sounds like great stuff... and you're doing great things here!

I've added a page about you on the Azimuth Wiki, based on yours here. You can edit it as you want.

The stuff at the bottom of the source code of this page ensures that if you edit an Azimuth Wiki page and sign in using the name fred.eisele or Fred Eisele, a link to your page will appear. We do this to make it easy for people to learn about the people who are editing this wiki.

`Hi! Sounds like great stuff... and you're doing great things here! I've added a [page about you](http://www.azimuthproject.org/azimuth/show/Fredrick+Eisele) on the Azimuth Wiki, based on yours here. You can edit it as you want. The stuff at the bottom of the source code of this page ensures that if you edit an Azimuth Wiki page and sign in using the name fred.eisele or Fred Eisele, a link to your page will appear. We do this to make it easy for people to learn about the people who are editing this wiki.`

I will try to help out as much as I can. The material is exactly what I have been asking for.

`I will try to help out as much as I can. The material is exactly what I have been asking for.`

Thanks for creating lots of exercise discussions!

Here's a problem I stumbled upon: in LaTeX, { and } are control characters, so

$$ f_! (A) := { y \in Y | \exists a \in A \text{ such that } f a = y } $$ merely produces

$$ f_! (A) := { y \in Y | \exists a \in A \text{ such that } f a = y } $$ In this installation of MathJax the solution is to use { and }. For example:

$$ f_! (A) := \{ y \in Y | \exists a \in A \text{ such that } f a = y \} $$ produces

$$ f_! (A) := { y \in Y | \exists a \in A \text{ such that } f a = y } $$ I'll repair these and other problems when I meet them. Starting on Thursday I'll go through all the exercises in Chapter 1 and "announce" them.

`Thanks for creating lots of exercise discussions! Here's a problem I stumbled upon: in LaTeX, { and } are control characters, so $$ f_! (A) := { y \in Y | \exists a \in A \text{ such that } f a = y } $$ merely produces $$ f_! (A) := { y \in Y | \exists a \in A \text{ such that } f a = y } $$ In this installation of MathJax the solution is to use \{ and \}. For example: $$ f_! (A) := \\{ y \in Y | \exists a \in A \text{ such that } f a = y \\} $$ produces $$ f_! (A) := \{ y \in Y | \exists a \in A \text{ such that } f a = y \} $$ I'll repair these and other problems when I meet them. Starting on Thursday I'll go through all the exercises in Chapter 1 and "announce" them.`

I add the Exercises as I work them out myself. Generally I have not been providing my own answers. If I doubt my answer then I put in my best guess.

The Chapter 2 exercises are now present and I am starting on Chapter 3.

`I add the Exercises as I work them out myself. Generally I have not been providing my own answers. If I doubt my answer then I put in my best guess. The Chapter 2 exercises are now present and I am starting on Chapter 3.`

Hi Fredrick,

I haven't looked into this much, but I guess you might be interested in knowing about this if you don't already (though I'm not sure how much benefit it would have to your current areas of research around data models and such): https://hackage.haskell.org/package/CPL

Also, since that is in haskell and you are doing some stuff on the JVM, I thought I'd mention Eta (https://eta-lang.org) which seems to be picking up steam lately.

`Hi Fredrick, I haven't looked into this much, but I guess you might be interested in knowing about this if you don't already (though I'm not sure how much benefit it would have to your current areas of research around data models and such): https://hackage.haskell.org/package/CPL Also, since that is in haskell and you are doing some stuff on the JVM, I thought I'd mention Eta (https://eta-lang.org) which seems to be picking up steam lately.`