Categories, Allegories, and Circuit Design

Brown, Carolyn; Hutton, Graham

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.

Citation

Brown, C., & Hutton, G. (1994). Categories, Allegories, and Circuit Design.

• Conference Name: Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
• Publication Date: Jan 1, 1994
• Deposit Date: Oct 26, 2005
• Publicly Available Date: Oct 9, 2007
• Peer Reviewed: Peer Reviewed
• Public URL: https://nottingham-repository.worktribe.com/output/1024729