Abstract

Machine by Curien [Cur86]. It is based upon a weak categorical combinatory logic, viz. lacking surjective pairing and extensionality, that arose as a direct semantic-to-syntactic translation of the lambda calculus of tuples. The computational mode was combinator term reduction through rewriting using a direct left-to-right parse algorithm, initially making the evaluation strategy inefficiently eager 1 . Application is therefore simply juxtaposition, losing the full expressiveness of-reduction 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 CAM-based ML compiler, CAML, gives significant encouragement towards developing a highly-programmable categorical computing paradigm. Some prominent workers in ...

Citations