Abstract
This paper presents the design of a language for the description and optimisation of reversible logic circuits. The language is a combinator-style functional language designed to be close to the reversible logical gate-level. The combinators include high-level constructs such as ripples, but also the recognisable inversion combinator f-1, which defines the inverse function of f using an efficient semantics. It is important to ensure that all circuits descriptions are reversible, and furthermore we must require this to be done statically. This is ensured by the type system, which also allows the description of arbitrary sized circuits. The combination of the functional language and the restricted reversible model results in many arithmetic laws, which provide more possibilities for term rewriting and, thus, the opportunity for good optimisation.
| Original language | English |
|---|---|
| Title of host publication | Implementation and Application of Functional Languages, IFL 2011 : 23rd International Symposium, IFL 2011, Lawrence, Kansas, USA, October 2011, Revised Papers |
| Editors | Andy Gill, Jurriaan Hage |
| Number of pages | 16 |
| Publisher | Springer |
| Publication date | 2012 |
| Pages | 148–163 |
| ISBN (Print) | 978-3-642-34406-0 |
| ISBN (Electronic) | 978-3-642-34407-7 |
| DOIs | |
| Publication status | Published - 2012 |
| Event | 23rd Symposium on Implementation and Application of Functional Languages - Lawrence, KS, United States Duration: 3 Oct 2011 → 5 Oct 2011 Conference number: 23 |
Conference
| Conference | 23rd Symposium on Implementation and Application of Functional Languages |
|---|---|
| Number | 23 |
| Country/Territory | United States |
| City | Lawrence, KS |
| Period | 03/10/2011 → 05/10/2011 |
| Series | Lecture notes in computer science |
|---|---|
| Volume | 7257 |