A. Gill, T. Bull, A. Farmer, G. Kimmell, and E. Komp, “Types and type families for hardware simulation and synthesis: The internals and externals of Kansas Lava,” in Post-Proceedings of Trends in Functional Programming, ser. LNCS, vol.

  1. Springer-Verlag, May 2010.

Abstract

In this paper,

we overview the design and implementation of our latest version of Kansas Lava. Driven by needs and experiences of implementing telemetry circuits, we have made a number of recent improvements to both the external API and the internal representations used. We have retained our dual shallow/deep representation of signals in general, but now have a number of externally visible abstractions for combinatorial, sequential, and enabled signals. We introduce these abstractions, as well as our new abstractions for memory and memory updates. Internally, we found the need to represent unknown values inside our circuits, so we made aggressive use of type families to lift our values in a principled and regular way. We discuss this design decision, how it unfortunately complicates the internals of Kansas Lava, and how we mitigate this complexity.

BibTeX

@inproceedings{Gill:10:TypesKansasLava,
  title = {Types and Type Families for Hardware Simulation and Synthesis: The Internals and Externals of {K}ansas {L}ava},
  author = {Andy Gill and Tristan Bull and Andrew Farmer and Garrin Kimmell and Ed Komp},
  booktitle = {Post-Proceedings of Trends in Functional Programming},
  month = {May},
  year = {2010},
  publisher = {Springer-Verlag},
  series = {LNCS},
  volume = {6546},
}