Lava
Authors:
Open Access
- 29 September 1998
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 34 (1) , 174-184
Abstract
Lava is a tool to assist circuit designers in specifying, designing, verifying and implementing hardware. It is a collection of Haskell modules. The system design exploits functional programming language features, such as monads and type classes, to provide multiple interpretations of circuit descriptions. These interpretations implement standard circuit analyses such as simulation, formal verification and the generation of code for the production of real circuits.Lava also uses polymorphism and higher order functions to provide more abstract and general descriptions than are possible in traditional hardware description languages. Two Fast Fourier Transform circuit examples illustrate this.Keywords
This publication has 5 references indexed in Scilit:
- Mechanically verifying the correctness of the Fast Fourier Transform in ACL21998
- GandalfJournal of Automated Reasoning, 1997
- Otter - The CADE-13 Competition IncarnationsJournal of Automated Reasoning, 1997
- Inverting the abstraction mapping: A methodology for hardware verification1996
- Transformational Rewriting with Ruby1993