Describing and optimizing reversible logic using a functional language

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Standard

Describing and optimizing reversible logic using a functional language. / Thomsen, Michael Kirkedal.

Implementation and Application of Functional Languages, IFL 2011: 23rd International Symposium, IFL 2011, Lawrence, Kansas, USA, October 2011, Revised Papers. ed. / Andy Gill; Jurriaan Hage. Springer, 2012. p. 148–163 (Lecture notes in computer science, Vol. 7257).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Harvard

Thomsen, MK 2012, Describing and optimizing reversible logic using a functional language. in A Gill & J Hage (eds), Implementation and Application of Functional Languages, IFL 2011: 23rd International Symposium, IFL 2011, Lawrence, Kansas, USA, October 2011, Revised Papers. Springer, Lecture notes in computer science, vol. 7257, pp. 148–163, 23rd Symposium on Implementation and Application of Functional Languages, Lawrence, KS, United States, 03/10/2011. https://doi.org/10.1007/978-3-642-34407-7_10

APA

Thomsen, M. K. (2012). Describing and optimizing reversible logic using a functional language. In A. Gill, & J. Hage (Eds.), Implementation and Application of Functional Languages, IFL 2011: 23rd International Symposium, IFL 2011, Lawrence, Kansas, USA, October 2011, Revised Papers (pp. 148–163). Springer. Lecture notes in computer science Vol. 7257 https://doi.org/10.1007/978-3-642-34407-7_10

Vancouver

Thomsen MK. Describing and optimizing reversible logic using a functional language. In Gill A, Hage J, editors, Implementation and Application of Functional Languages, IFL 2011: 23rd International Symposium, IFL 2011, Lawrence, Kansas, USA, October 2011, Revised Papers. Springer. 2012. p. 148–163. (Lecture notes in computer science, Vol. 7257). https://doi.org/10.1007/978-3-642-34407-7_10

Author

Thomsen, Michael Kirkedal. / Describing and optimizing reversible logic using a functional language. Implementation and Application of Functional Languages, IFL 2011: 23rd International Symposium, IFL 2011, Lawrence, Kansas, USA, October 2011, Revised Papers. editor / Andy Gill ; Jurriaan Hage. Springer, 2012. pp. 148–163 (Lecture notes in computer science, Vol. 7257).

Bibtex

@inproceedings{6422343ad1454bad95fb263808cbb20b,
title = "Describing and optimizing reversible logic using a functional language",
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 en- sured 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.",
author = "Thomsen, {Michael Kirkedal}",
year = "2012",
doi = "10.1007/978-3-642-34407-7_10",
language = "English",
isbn = "978-3-642-34406-0",
series = "Lecture notes in computer science",
publisher = "Springer",
pages = "148–163",
editor = "Gill, {Andy } and Jurriaan Hage",
booktitle = "Implementation and Application of Functional Languages, IFL 2011",
address = "Switzerland",
note = "null ; Conference date: 03-10-2011 Through 05-10-2011",

}

RIS

TY - GEN

T1 - Describing and optimizing reversible logic using a functional language

AU - Thomsen, Michael Kirkedal

N1 - Conference code: 23

PY - 2012

Y1 - 2012

N2 - 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 en- sured 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.

AB - 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 en- sured 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.

U2 - 10.1007/978-3-642-34407-7_10

DO - 10.1007/978-3-642-34407-7_10

M3 - Article in proceedings

SN - 978-3-642-34406-0

T3 - Lecture notes in computer science

SP - 148

EP - 163

BT - Implementation and Application of Functional Languages, IFL 2011

A2 - Gill, Andy

A2 - Hage, Jurriaan

PB - Springer

Y2 - 3 October 2011 through 5 October 2011

ER -

ID: 37560201