Representational and Denotational Semantics of Digital Systems

The input/output transformation effected by digital systems can be considered as concrete realizations of abstract mathematical functions. The mappings between abstract functions and concrete realizations, if kept explicit throughout the formulation, constitute the necessary 'handles' (embodied by function definitions) for transformational reasoning about digital systems. Deductive reasoning can be factored out and reduced considerably. This is demonstrated by a functional recast of the major parts of digital systems theory. Since the emphasis of this study is on the method (transformational reasoning) rather than on new system concepts, examples are chosen from familiar areas. However, some new results are obtained. >

[1]  Raymond T. Boute,et al.  System Semantics and formal circuit description , 1986 .

[2]  John W. Backus,et al.  Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.

[3]  Robin Milner,et al.  Processes: A Mathematical Model of Computing Agents , 1975 .

[4]  Michael A. Arbib,et al.  Theories of abstract automata , 1969, Prentice-Hall series in automatic computation.

[5]  Edward P. Stabler,et al.  System Description Languages , 1970, IEEE Transactions on Computers.

[6]  Arthur D. Friedman,et al.  Logical design of digital systems , 1975 .

[7]  Kai Hwang,et al.  Computer arithmetic: Principles, architecture, and design , 1979 .

[8]  D. A. Turner,et al.  Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.

[9]  W. Neu,et al.  Project for a Digital Telephone Network , 1968 .

[10]  Joseph E. Stoy,et al.  Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .

[11]  Hiroto Yasuura,et al.  High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree , 1985, IEEE Transactions on Computers.

[12]  Steven D. Johnson.  Synthesis of digital designs from recursion equations , 1983 .

[13]  Michael J. C. Gordon,et al.  The Denotational Semantics of Sequential Machines , 1980, Inf. Process. Lett..

[14]  Michael A Arbib,et al.  Theories of abstract automata (Prentice-Hall series in automatic computation) , 1969 .

[15]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[16]  Mary Sheeran,et al.  muFP, a language for VLSI design , 1984, LFP '84.

[17]  John V. Guttag,et al.  Abstract data types and the development of data structures , 1977, CACM.

[18]  Algirdas Avizienis,et al.  Signed-Digit Numbe Representations for Fast Parallel Arithmetic , 1961, IRE Trans. Electron. Comput..