Re: diagrams in computer algebra

[Michael J Healy <mjhealy@ece.unm.edu>]

Vasili,

Certainly---we'll be happy to do this for anybody who is interested.  Looks like I need to start a list.

I might mention again that we're leaning heavily on the work of Johnson and Rosebrugh.  Just for the record, though, any problems with anything we generate are strictly our own doing.  We're having to translate  adjunctions into software methods for generating the functors we need, and then the colimit theorem into software so we can generate ontologies as colimits in Cat.

Regards again,
Mike

On Oct 8, 2011, at 3:17 PM, Vasili I. Galchin wrote:

> Hi Mike and Sergei,
> 
>    I have also thought doing exactly this in Haskell but for dealing
> with sheafs. Is there any way Mike that I could monitor the progress
> of your effort assuming you will make source available as you said
> perhaps below?
> 
> Vasili
> 
> On Mon, Oct 3, 2011 at 1:02 PM, Michael J Healy <mjhealy@ece.unm.edu> wrote:
>> 
>> Sergei,
>> 
>> My colleagues and I have been looking for something like this for a project.  We need to be able to specify small categories as the completions of finite graphs we are given, extend these by specifying commutative diagrams, pullbacks, etc, of interest, then define functors generated from graph homomorphisms, and take colimits of diagrams in Cat, etc etc.  We haven't found anything that does all this.  So, we're programming it in Haskell---one of our grad students knows the language.    We'll be happy to share our experience and will probably make the code available.  It's a work in progress.
>> 
>> Best regards,
>> Mike Healy
>> 

[For admin and other information see: http://www.mta.ca/~cat-dist/ ]