Home > Publications
Home University of Twente
Prospective Students
Intranet (internal)

EEMCS EPrints Service

23939 Digital circuit in CλaSH: functional specifications and type-directed synthesis
Home Policy Brochure Browse Search User Area Contact Help

Baaij, C.P.R. (2015) Digital circuit in CλaSH: functional specifications and type-directed synthesis. PhD thesis, University of Twente. CTIT Ph.D.-thesis series No. 14-335 ISBN 978-90-365-3803-9

Full text available as:


4684 Kb
Open Access

Official URL:

Exported to Metis


Over the last three decades, the number of transistors used in microchips has increased by three orders of magnitude, from millions to billions.
The productivity of the designers, however, lags behind.
Managing to implement complex algorithms, while keeping non-functional properties within desired bounds, and thoroughly verifying the design against its specification, are the main difficulties in circuit design.

As a motivation for our work we make a qualitative analysis of the tools available to circuit designers.
Here we see that progress has been slow, and that the same techniques have been used for over 20 years.

We claim that functional languages can be used to raise the abstraction level in circuit design.
Especially higher-order functional languages, where functions are first-class and can be manipulated by other functions, offer a single abstraction mechanism that can capture many design patterns.

This thesis explores the idea of using the functional language Haskell directly as a hardware specification language, and move beyond the limitations of embedded languages.
Additionally, we can use normal functions from existing Haskell libraries to model the behaviour of our circuits.

This thesis describes the inner workings of our C$\lambda$aSH compiler, which translates the aforementioned circuit descriptions written in Haskell to low-level descriptions in VHDL.
The challenge then becomes the reduction of the higher-level abstractions in the descriptions to a form where synthesis is feasible.
This thesis describes a term rewrite system (with bound variables) to achieve this reduction.
We prove that this term rewrite system always reduces a polymorphic, higher-order circuit description to a synthesisable variant.

Even when descriptions use high-level abstractions, the C$\lambda$aSH compiler can synthesize efficient circuits.
Case studies show that circuits designed in Haskell, and synthesized with the C?aSH compiler, are on par with hand-written VHDL, in both area and gate propagation delay.

This thesis thus shows the merits of using a modern functional language for circuit design.
The advanced type system and higher-order functions allow us to design circuits that have the desired property of being correct-by-construction.
Finally, our synthesis approach enables us to derive efficient circuits from descriptions that use high-level abstractions.

Item Type:PhD Thesis
Supervisors:Smit, G.J.M.
Assistant Supervisors:Kuper, J.
Research Group:EWI-CAES: Computer Architecture for Embedded Systems
Research Program:CTIT-General
Research Project:SoOS: Service-oriented Operating Systems, POLCA: Programming Large Scale Heterogeneous Infrastructures
Uncontrolled Keywords:Digital Circuits, Functional Programming, Haskell, FPGA, Hardware, Lambda Calculus, Rewrite Systems
ID Code:23939
Deposited On:19 May 2015
More Information:statisticsmetis

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item