Hiding State in CλaSH Hardware Descriptions


Gerards, Marco and Baaij, Christiaan and Kuper, Jan and Kooijman, Matthijs (2010) Hiding State in CλaSH Hardware Descriptions. In: 22nd Symposium on Implementation and Application of Functional Languages, IFL 2010, 1-3 Sept 2010, Alphen aan den Rijn, the Netherlands (pp. pp. 107-119).

open access
Abstract:Synchronous hardware can be modelled as a mapping from input and state to output and a new state, such mappings are referred to as transition functions. It is natural to use a functional language to implement transition functions. The CaSH compiler is capable of translating transition functions to VHDL. Modelling hardware using multiple components is convenient. Components in CaSH can be considered as instantiations of functions. To avoid packing and unpacking state when composing components, functions are lifted to arrows. By using arrows the chance of making errors will decrease as it is not required to manually (un)pack the state. Furthermore, the Haskell do-syntax for arrows increases the readability of hardware designs. This is demonstrated using a realistic example of a circuit which consists of multiple components.
Item Type:Conference or Workshop Item
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/78215
Official URL:http://www.cs.uu.nl/research/techreps/repo/CS-2010/2010-020.pdf
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page