next up previous contents
Next: Optimal reductions in the Up: Progress Previous: Progress

Foundational models and abstract machines

This area treats of various models for rewrite systems with bound variables. It has actually 3 parts. First, we pursue the work on functional models, i.e. optimal reductions in the lambda calculus, sequentiality and axiomatic rewriting systems. Secondly, we consider new models for concurrency, ie action calculi and the tile model. Finally, we treat of the use of rewrite rules as a model for the optimisation of concurrent programs.