Categories for the working hardware designer
We show how standard results from category theory can be used to derive useful theorems about a hardware description language. The theorems correspond to behaviour preserving circuit transformations. We also show how a categorical viewpoint can help in the design of a formally based hardware description language. All necessary category theory is introduced.
KeywordsType System Composition Operator Natural Transformation Category Theory Hardware Description Language
Unable to display preview. Download preview PDF.
- R.J.M. Hughes, Projections for Polymorphic Strictness Analysis, Proc. Int. Conf. on Category Theory in Computer Science, Manchester, Springer-Verlag, 1989.Google Scholar
- G. Jones, Fast Fourier transform by program transformation of the discrete Fourier transform, (submitted for publication).Google Scholar
- G. Jones & M. Sheeran, Timeless Truths about Sequential Circuits, Chapter 14 in S.K. Tewksbury et al (eds.) Concurrent Computations: Algorithms, Architecture and Technology, Plenum Press, 1988.Google Scholar
- C.E. Leiserson & J.B. Saxe, Retiming Synchronous Circuitry, Tech. Report 13, Digital Systems Research Center, Palo Alto, California 94301, 1986.Google Scholar
- M. Sheeran, Retiming and Slowdown in Ruby, in G. Milne (ed.) The Fusion of Hardware Design and Verification, North-Holland, 1988.Google Scholar
- M. Sheeran, Describing Hardware Algorithms in Ruby, to appear in Proc. IFIP WG10.1 Int. Workshop on Concepts and Characteristics of Declarative Systems, North-Holland, 1989.Google Scholar
- P.L. Wadler, Theorems for Free!, to appear in Proc. Int. Conf. on Functional Programming Languages and Computer Architecture, London, Springer-Verlag, 1989.Google Scholar