Composed Reduction Systems
Composed Reduction Systems
David Sands
In 6th
NWPT, pages 359-376
Abstract:
This paper studies composed reduction systems: a system
of programs built up from the reduction relations of some reduction system,
by means of parallel and sequential composition operators. The trace-based
compositional semantics of composed reduction systems is considered, and a
new graph-representation is introduced as an alternative basis for the study
of compositional semantics, refinement, true concurrency (in the case of
composed rewriting systems) and program logics.
Comments
DIKU, University of Copenhagen.
Available as PostScript,
DVI.
BRICS WWW home page