Categories, Allegories, and Circuit Design
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...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
1994
|
| Online Access: | https://eprints.nottingham.ac.uk/232/ |
| _version_ | 1848790375501660160 |
|---|---|
| author | Brown, Carolyn Hutton, Graham |
| author_facet | Brown, Carolyn Hutton, Graham |
| author_sort | Brown, Carolyn |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T18:11:37Z |
| format | Conference or Workshop Item |
| id | nottingham-232 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T18:11:37Z |
| publishDate | 1994 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-2322020-05-04T20:33:42Z https://eprints.nottingham.ac.uk/232/ Categories, Allegories, and Circuit Design Brown, Carolyn Hutton, Graham 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. 1994 Conference or Workshop Item PeerReviewed Brown, Carolyn and Hutton, Graham (1994) Categories, Allegories, and Circuit Design. In: Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science, July 1994, Paris, France. |
| spellingShingle | Brown, Carolyn Hutton, Graham Categories, Allegories, and Circuit Design |
| title | Categories, Allegories, and Circuit Design |
| title_full | Categories, Allegories, and Circuit Design |
| title_fullStr | Categories, Allegories, and Circuit Design |
| title_full_unstemmed | Categories, Allegories, and Circuit Design |
| title_short | Categories, Allegories, and Circuit Design |
| title_sort | categories, allegories, and circuit design |
| url | https://eprints.nottingham.ac.uk/232/ |