Abstract
This paper presents three paradigms for circuit design, and investigates the relationships between them. These paradigms are syntactic (based on Freyd and Scedrov's unitary pre-tabular allegories (upas), pictorial (based on the net list model of circuit connectivity), and relational (based on Sheeran's relational model of circuit design Ruby). We show that net lists over a given signature ∑ constitute the free upa on ∑. Our proof demonstrates that nets and upas are equally expressive, and that nets provide a normal form for both upas and pictures. We use Freyd and Scedrov's representation theorem for upas to show that our relational interpretations constitute a sound and complete class of models for the upa axioms. Thus we can reason about circuits using either the upa axioms, pictures or relations. By considering garbage collection, we show that there is no faithful representation of nets in Rel: we conjecture that a semantics for nets which takes garbage collection into account is faithfully representable in Rel.
Alan Jeffrey is funded by SERC project GR/H 16537
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Carolyn Brown and Graham Hutton. Categories, allegories and circuit design. To appear in Proc. LICS, 1994.
Aurelio Carboni and Bob Walters. Cartesian bicategories I. J. Pure and Applied Algebra, 49:11–32, 1987.
Peter J. Freyd and Andre Scedrov. Categories, Allegories. North-Holland, 1990.
Randall L. Geiger, Phillip E. Allen, and Noel R. Strader. VLSI Design Techniques for Analog and Digital Circuits. McGraw Hill, 1990.
Steven M. Rubin. Computer Aids for VLSI Design. Addison Wesley, 1987.
Mary Sheeran. Describing and reasoning about circuits using relations. In J. Tucker et al., editors, Proc. Workshop in Theoretical Aspects of VLSI, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brown, C., Jeffrey, A. (1994). Allegories of circuits. In: Nerode, A., Matiyasevich, Y.V. (eds) Logical Foundations of Computer Science. LFCS 1994. Lecture Notes in Computer Science, vol 813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58140-5_7
Download citation
DOI: https://doi.org/10.1007/3-540-58140-5_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58140-6
Online ISBN: 978-3-540-48442-4
eBook Packages: Springer Book Archive