A categorical algorithm for calculating flow graphs

DRAFT of 1997/08/21

Alan Jeffrey
School of Cognitive and Computing Sciences
University of Sussex
Brighton BN1 9QH
UK
alanje@cogs.susx.ac.uk

This paper describes an algorithm for drawing mixed data flow and control flow graphs from program source. It is based on categorical semantics of programs, in particular Power and Robinson's premonoidal categories, and Hasegawa's presentation of Joyal, Street and Verity's traced monoidal categories.

This paper currently does not exist!

Previous | Next