Results 1 
3 of
3
Coinductive Interpreters for Process Calculi
 In Sixth International Symposium on Functional and Logic Programming, volume 2441 of LNCS
, 2002
"... This paper suggests functional programming languages with coinductive types as suitable devices for prototyping process calculi. The proposed approach is independent of any particular process calculus and makes explicit the dierent ingredients present in the design of any such calculi. In partic ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This paper suggests functional programming languages with coinductive types as suitable devices for prototyping process calculi. The proposed approach is independent of any particular process calculus and makes explicit the dierent ingredients present in the design of any such calculi. In particular structural aspects of the underlying behaviour model become clearly separated from the interaction structure which de nes the synchronisation discipline. The approach is illustrated by the detailed development in Charity of an interpreter for a family of process languages.
Homomorphisms, Factorisation and Promotion
, 1990
"... i +(iA XiA.) or ([,]iA)O =i, , ([,]iA)o(az)=(a,z). Example 4. Another typefunctor is the nonempty joinlist constructor., with BA=A+(BxB) , gf =f +(gxg) The reader is encouraged to draw the corresponding diagram, and investigate its meaning. (We have not required I I to be associative, so we r ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
i +(iA XiA.) or ([,]iA)O =i, , ([,]iA)o(az)=(a,z). Example 4. Another typefunctor is the nonempty joinlist constructor., with BA=A+(BxB) , gf =f +(gxg) The reader is encouraged to draw the corresponding diagram, and investigate its meaning. (We have not required I I to be associative, so we really have specified binary trees.) [] 3 Maps A map is the part of a typefunctor that works on functions. In general we have, for a typefunctor t and a function f: A B, a tmapped function: ft: A t _ B t. Functors preserve identity and composition: (iA)t = i, , (g o f)t = gt o ft. The idea is that a mapped function only works on the Aelements of a ALterre, leaving the structure unchanged. 4 We can define maps as homomorphisms. function such that order to do so, we try to find b = ft: A t ._ B t. We can do this by first applying f to the Aelements of the (B t [ A)term, giving a term in Bt [ B. Then we embed this in a Btstructure by applying the constructors B. Definition 5.
A Survey of Categorical Computation: Fixed Points, . . .
, 1990
"... Machine by Curien [Cur86]. It is based upon a weak categorical combinatory logic, viz. lacking surjective pairing and extensionality, that arose as a direct semantictosyntactic translation of the lambda calculus of tuples. The computational mode was combinator term reduction through rewriting usin ..."
Abstract
 Add to MetaCart
Machine by Curien [Cur86]. It is based upon a weak categorical combinatory logic, viz. lacking surjective pairing and extensionality, that arose as a direct semantictosyntactic translation of the lambda calculus of tuples. The computational mode was combinator term reduction through rewriting using a direct lefttoright parse algorithm, initially making the evaluation strategy inefficiently eager 1 . Application is therefore simply juxtaposition, losing the full expressiveness ofreduction that computes via substitution. Its overly strong bias towards the lambda calculus was another factor that limited its expressiveness. On one hand the CAM demanded the existence of categorical products but on the other it had no coproducts for developing many useful data structures. Nevertheless, the high acceptance and efficiency of the CAMbased ML compiler, CAML, gives significant encouragement towards developing a highlyprogrammable categorical computing paradigm. Some prominent workers in ...