On Friday October 17, this site was moved to a new server, https://mw.hh.se. The original address will continue to work. Whithin a week or two this site will return to the original address. /Peo HH IT-dep

WG211/M3Herrmann: Difference between revisions

From WG 2.11
Jump to navigationJump to search
m 1 revision
 
No edit summary
Line 1: Line 1:
[[Category:WG211]]
[[Category:WG211]]


 
Christoph A. Herrmann
<HTML>
<HEAD>
<title>Christoph A. Herrmann</title>
</head>
 
<body bgcolor="white">


Title:
Title:
Line 19: Line 13:
At first, a skeleton generator is introduced which provides abstraction from the low-level details of Template Haskell. We use it to generate combinators for parallel and sequential composition which are then taken to define circuits for addition, multiplication, etc. Other combinators simplify the task of connecting the appropriate wires.
At first, a skeleton generator is introduced which provides abstraction from the low-level details of Template Haskell. We use it to generate combinators for parallel and sequential composition which are then taken to define circuits for addition, multiplication, etc. Other combinators simplify the task of connecting the appropriate wires.


</BODY>
</html>


==File Attachments==  
==File Attachments==  


*[[Media:herrmann.pdf | herrmann.pdf]]
*[[Media:herrmann.pdf | herrmann.pdf]]

Revision as of 14:27, 16 December 2011


Christoph A. Herrmann

Title: Generating Size-Parameterized Functions for Circuit Simulation Using Template Haskell
Speaker: Christoph A. Herrmann

Slides: <A HREF="http://pub.smart-generators.org/M3Schedule/herrmann.pdf">.pdf</A>

Abstract:
Template Haskell permits the generation of functions whose types depend on static parameter values. We use this feature to develop a library of circuit designs which are parameterized in bitsize. The inputs and outputs of these designs are tuples of parameterized numbers of components. The advantage of tuples to lists or arrays is that the type checker ensures the consistency of the sizes at compile time. At first, a skeleton generator is introduced which provides abstraction from the low-level details of Template Haskell. We use it to generate combinators for parallel and sequential composition which are then taken to define circuits for addition, multiplication, etc. Other combinators simplify the task of connecting the appropriate wires.

File Attachments