Next: Persons and exchanges Up: KTH Previous: KTH
We have developed the update-calculus where processes can perform update actions with side effects, and a scoping operator controls the extent of the effects [PV97]. In this way it incorporates fundamental concepts from imperative languages, concurrent constraints and from functional formalisms. Structurally it is similar to but simpler than the pi-calculus; it has only one binding operator and a symmetry between inpout and output.
Furthermore, we have completed earlier work within Confer-1 regarding unfold/fold program transformations in languages with nondeterminism [Lisp98]. These results hold under the classical condition of ``restricted folding-unfolding'' [Cou90], which is quite restrictive with respect to the formation of new recursive definitions. We have made some initial investigations towards extending the results to the particular formation of new recursive definitions that typically occur during program specialization.