Re: Evaluation of source code, category theoretically?
Thanks, all for your responses so far; many of you have asked what my motivation was for the question. I'm trying to understand pi calculus. I've got a bicategorical model of a fragment of pi calculus where prefixing is composition, but in order to prevent reduction under a prefix, the remainder of the term needs to be suspended; one way to do that is to treat it as "source code" and evaluate it in an environment with bindings, thus my question. On Thu, Jan 2, 2014 at 11: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/ ]
participants (1)
-
Mike Stay