Digital systems and hardware/firmware algorithms
Digital systems and hardware/firmware algorithms
Semantics of digital circuits
An introduction to the theory of lists
Proceedings of the NATO Advanced Study Institute on Logic of programming and calculi of discrete design
Representational and Denotational Semantics of Digital Systems
IEEE Transactions on Computers
Specification and Verification Using Dependent Types
IEEE Transactions on Software Engineering
Designing arithmetic circuits by refinement in Ruby
Science of Computer Programming - Special issue on mathematics of program construction
Lava: hardware design in Haskell
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Extracting and implementing list homomorphisms in parallel program development
Science of Computer Programming
Network Algebra
A Formal Approach to Hardware Design
A Formal Approach to Hardware Design
Introduction to VLSI Systems
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
Functional Design Using Behavioural and Structural Components
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Proceedings of the Second International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Transformational Development of Circuit Descriptions for Binary Adders
Method of Programming, Selected Papers on the CIP-Project
Computer aided fusion for algebraic program derivation
Nordic Journal of Computing
muFP, a language for VLSI design
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Hi-index | 0.00 |
We present a framework for the unifying high-level synthesis of tree-structured and iterative combinational networks. Based on the theory of list homomorphisms, we develop a standard implementation for tree-structured modules processing the input digits in parallel. The design is systematically specialized to iterative networks processing the input sequentially from the least resp. from the highest significant positions. Throughout the paper, we explicate functional methods for the transformational design of combinational circuits. We illustrate the approach with a parity generator module, a comparator module, and a priority resolution module.