Advertisement

Categories for the working hardware designer

  • Mary Sheeran
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 408)

Abstract

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.

Keywords

Type System Composition Operator Natural Transformation Category Theory Hardware Description Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R.J.M. Hughes, Projections for Polymorphic Strictness Analysis, Proc. Int. Conf. on Category Theory in Computer Science, Manchester, Springer-Verlag, 1989.Google Scholar
  2. [2]
    G. Jones, Fast Fourier transform by program transformation of the discrete Fourier transform, (submitted for publication).Google Scholar
  3. [3]
    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
  4. [4]
    C.E. Leiserson & J.B. Saxe, Retiming Synchronous Circuitry, Tech. Report 13, Digital Systems Research Center, Palo Alto, California 94301, 1986.Google Scholar
  5. [5]
    M. Sheeran, Retiming and Slowdown in Ruby, in G. Milne (ed.) The Fusion of Hardware Design and Verification, North-Holland, 1988.Google Scholar
  6. [6]
    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
  7. [7]
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Mary Sheeran
    • 1
  1. 1.Computing Science Dept.Glasgow UniversityGlasgowScotland

Personalised recommendations