Ok, so we can say that obviously having name-passing in the Ambient Calculus
allows us to model functions, however, is there any encoding of functions
out there that uses the core language only, i.e. without any name-passing
behaviour?
Ben
there are many results (following milner's encoding of the lambda
calculus)
that show how pi-calculus contains (in a strong and precise sense)
functional
behaviour as subbehaviours. i would imagine that this generalises to
ambient
calculi, as least when they include pi-like name-passing. if true,
functions
are already there and adding explicity combinators for functions would be
no
more than syntactic sugar.