ACM Home Page
Please provide us with feedback. Feedback
Functional netlists
Full text PdfPdf (484 KB)
Source
International Conference on Functional Programming archive
Proceeding of the 13th ACM SIGPLAN international conference on Functional programming table of contents
Victoria, BC, Canada
SESSION: Session 14 table of contents
Pages 353-366  
Year of Publication: 2008
ISBN:978-1-59593-919-7
Also published in ...
Authors
Sungwoo Park  Pohang University of Science and Technology, Gyeongbuk, South Korea
Jinha Kim  Pohang University of Science and Technology, Gyeongbuk, South Korea
Hyeonseung Im  Pohang University of Science and Technology, Gyeongbuk, South Korea
Sponsors
ACM: Association for Computing Machinery
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 61,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1411204.1411253
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked 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
 
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
6
 
7
8
 
9
Geraint Jones and Mary Sheeran. Circuit design in Ruby. Formal Methods in VLSI Design, pages 13--70, 1990.
 
10
 
11
12
 
13
 
14
 
15
 
16
17
 
18
Mary Sheeran. Hardware design and functional programming: a perfect match. The Journal of Universal Computer Science, 11 (7):1135--1158, 2005.
19

Collaborative Colleagues:
Sungwoo Park: colleagues
Jinha Kim: colleagues
Hyeonseung Im: colleagues