Functional netlists
Abstract
In efforts to overcome the complexity of the syntax and the lack of formal semantics of conventional hardware description languages, a number of functional hardware description languages have been developed. Like conventional hardware description languages, however, functional hardware description languages eventually convert all source programs into netlists, which describe wire connections in hardware circuits at the lowest level and conceal all high-level descriptions written into source programs.
We develop a variant of the lambda calculus, called lλ (linear lambda), which may serve as a high-level substitute for netlists. In order to support higher-order functions, lλ uses a linear type system which enforces the linear use of variables of function type. The translation of lλ into structural descriptions of hardware circuits is sound and complete in the sense that it maps expressions only to realizable hardware circuits and that every realizable hardware circuit has a corresponding expression in lλ. To illustrate the use of lλ as a high-level substitute for netlists, we design a simple hardware description language that extends lλ with polymorphism, and use it to implement a Fast Fourier Transform circuit.
Supplementary Material
References
[1]
Emil Axelsson, Koen Claessen, and Mary Sheeran. Wired: wireaware circuit design. In Proceedings of Conference on Correct Hardware Design and Verification Methods (CHARME), volume 3725 of Lecture Notes in Computer Science. Springer Verlag, 2005.
[2]
Per Bjesse, Koen Claessen, Mary Sheeran, and Satnam Singh. Lava: hardware design in Haskell. In Proceedings of the third ACM SIGPLAN international conference on Functional programming, pages 174--184. ACM Press, 1998.
[3]
Raymond T. Boute. Functional languages and their application to the description of digital systems. Journal A, 25(1):27--33, 1984.
[4]
Luca Cardelli and Gordon Plotkin. An algebraic approach to VLSI design. In Proceedings of the VLSI 81 International Conference, pages 173--182, 1981.
[5]
Koen Claessen and David Sands. Observable sharing for functional circuit description. In ASIAN '99: Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science, pages 62--73. Springer-Verlag, 1999.
[6]
Dan R. Ghica. Geometry of synthesis: a structured approach to VLSI design. In Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 363--375. ACM Press, 2007.
[7]
Jim Grundy, Tom Melham, and John O'Leary. A reflective functional language for hardware design and theorem proving. Journal of Functional Programming, 16(2):157--196, 2006.
[8]
Steven D. Johnson. Applicative programming and digital design. In Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pages 218--227. ACM Press, 1984.
[9]
Geraint Jones and Mary Sheeran. Circuit design in Ruby. Formal Methods in VLSI Design, pages 13--70, 1990.
[10]
Yanbing Li and Miriam Leeser. HML, a novel hardware description language and its translation to VHDL. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 8(1):1--8, 2000.
[11]
John Matthews, Byron Cook, and John Launchbury. Microprocessor specification in Hawk. In Proceedings of the 1998 International Conference on Computer Languages, page 90. IEEE, 1998.
[12]
F. Meshkinpour and Milos D. Ercegovac. A functional language for description and design of digital systems: sequential constructs. In Proceedings of the 22nd ACM/IEEE conference on Design automation, pages 238--244. ACM press, 1985.
[13]
Alan Mycroft and Richard Sharp. A statically allocated parallel functional language. In ICALP '00: Proceedings of the 27th International Colloquium on Automata, Languages and Programming, pages 37--48. Springer-Verlag, 2000.
[14]
John J. O'Donnell. From transistors to computer architecture: Teaching functional circuit specification in Hydra. In Proceedings of the First International Symposium on Functional Programming Languages in Education, pages 195--214. Springer-Verlag, 1995.
[15]
John T. O'Donnell. Generating netlists from executable circuit specifications. In Proceedings of the 1992 Glasgow Workshop on Functional Programming, pages 178--194. Springer-Verlag, 1993.
[16]
Peter O'Hearn. On bunched typing. Journal of Functional Programming, 13(4):747--796, 2003.
[17]
Robin Sharp and Ole Rasmussen. Using a language of functions and relations for VLSI specification. In Proceedings of the seventh international conference on Functional programming languages and computer architecture, pages 45--54. ACM Press, 1995.
[18]
Mary Sheeran. Hardware design and functional programming: a perfect match. The Journal of Universal Computer Science, 11 (7):1135--1158, 2005.
[19]
Mary Sheeran. muFP, a language for VLSI design. In Proceedings of the 1984 ACM Symposium on LISP and functional programming, pages 104--112. ACM Press, 1984.
Recommendations
Functional netlists
ICFP '08: Proceedings of the 13th ACM SIGPLAN international conference on Functional programmingIn efforts to overcome the complexity of the syntax and the lack of formal semantics of conventional hardware description languages, a number of functional hardware description languages have been developed. Like conventional hardware description ...
Formal Design of Arithmetic Circuits Based on Arithmetic Description Language
This paper presents a formal design of arithmetic circuits using an arithmetic description language called ARITH. The key idea in ARITH is to describe arithmetic algorithms directly with high-level mathematical objects (i.e., number representation ...
Formal verification of cryptographic circuits: A semi-automatic functional approach
NISS '19: Proceedings of the 2nd International Conference on Networking, Information Systems & SecurityThe complexity level of hardware design has increased extensively, and consequently it became subject of errors. That's why it is extremely important to verify the correctness of designs, especially in critical systems like those of security.
The ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
September 2008422 pages
Copyright © 2008 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 September 2008
Published in SIGPLAN Volume 43, Issue 9
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations2Total Citations
- 306Total Downloads
- Downloads (Last 12 months)7
- Downloads (Last 6 weeks)2
Reflects downloads up to 24 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in