i am hoping that you might also like monoidal computer http://arxiv.org/abs/1208.5205 it's similar to robin's turing categories, but also quite different. it's all in string diagrams. there is also a complexity theory paper, with a much better string diagram language, which i still didn't upload on arxiv, but will do soon. comments welcome and appreciated. -- dusko On Jan 2, 2014, at 8:05 AM, Mike Stay <metaweta@gmail.com> wrote:
What's the right way to think about evaluation in category theory? I'm guessing it will look kind of like this: the category will be symmetric monoidal closed and equipped with an object S whose points are "source code", together with a collection of interpreter epimorphisms run_{X, Y}: S -> [X, Y] and some notion of composition in S that works well with composition of morphisms.
What are the right keywords for doing a literature search on this? -- Mike Stay - metaweta@gmail.com http://www.cs.auckland.ac.nz/~mike http://reperiendi.wordpress.com
[For admin and other information see: http://www.mta.ca/~cat-dist/ ]
[For admin and other information see: http://www.mta.ca/~cat-dist/ ]