High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree
IEEE Transactions on Computers
Miranda: a non-strict functional language with polymorphic types
Proc. of a conference on Functional programming languages and computer architecture
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Communications of the ACM
Abstract data types and the development of data structures
Communications of the ACM
Synthesis of Digital Design from Recursive Equations
Synthesis of Digital Design from Recursive Equations
Computer Arithmetic: Principles, Architecture and Design
Computer Arithmetic: Principles, Architecture and Design
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Logical Design of Digital Systems
Logical Design of Digital Systems
muFP, a language for VLSI design
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Theories of abstract automata (Prentice-Hall series in automatic computation)
Theories of abstract automata (Prentice-Hall series in automatic computation)
Correction to 'Representational and Denotational Semantics of Digital Systems'
IEEE Transactions on Computers
The Euclidean definition of the functions div and mod
ACM Transactions on Programming Languages and Systems (TOPLAS)
Formal Verification Using Edge-Valued Binary Decision Diagrams
IEEE Transactions on Computers
Designing combinational circuits with list homomorphisms
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science,Software Engineering, Information Technology, e-Business, and Applications, 2003
| Hi-index | 14.99 |
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.