@inproceedings { , title = {Categories, Allegories, and Circuit Design}, abstract = {Languages based upon binary relations offer an appealing setting for constructing programs from specifications. For example, working with relations rather than functions allows specifications to be more abstract (for example, many programs have a natural specification using the converse operator on relations), and affords a natural treatment of non-determinism in specifications. In this paper we present a novel pictorial interpretation of relational terms as simple pictures of circuits, and a soundness/completeness result that allows relational equations to be proved by pictorial reasoning.}, conference = {Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science}, organization = {Paris, France}, publicationstatus = {Published}, url = {https://nottingham-repository.worktribe.com/output/1024729}, year = {1994}, author = {Brown, Carolyn and Hutton, Graham} }