A functional language for describing reversible logic

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

Standard

A functional language for describing reversible logic. / Thomsen, Michael Kirkedal.

Proceedings of the 2012 Forum on Specification and Design Languages. red. / Adam Morawiec; Jinnie Hinderscheit. IEEE, 2012. s. 135-142.

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

Harvard

Thomsen, MK 2012, A functional language for describing reversible logic. i A Morawiec & J Hinderscheit (red), Proceedings of the 2012 Forum on Specification and Design Languages. IEEE, s. 135-142, 2012 Forum on specification & Design Languages, Vienna, Østrig, 18/09/2012. <http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=6336999&contentType=Conference+Publications>

APA

Thomsen, M. K. (2012). A functional language for describing reversible logic. I A. Morawiec, & J. Hinderscheit (red.), Proceedings of the 2012 Forum on Specification and Design Languages (s. 135-142). IEEE. http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=6336999&contentType=Conference+Publications

Vancouver

Thomsen MK. A functional language for describing reversible logic. I Morawiec A, Hinderscheit J, red., Proceedings of the 2012 Forum on Specification and Design Languages. IEEE. 2012. s. 135-142

Author

Thomsen, Michael Kirkedal. / A functional language for describing reversible logic. Proceedings of the 2012 Forum on Specification and Design Languages. red. / Adam Morawiec ; Jinnie Hinderscheit. IEEE, 2012. s. 135-142

Bibtex

@inproceedings{a6793a02996642dfb2b26a0e8db2f3bd,
title = "A functional language for describing reversible logic",
abstract = "Reversible logic is a computational model where all gates are logically reversible and combined in circuits such that no values are lost or duplicated. This paper presents a novel functional language that is designed to describe only reversible logic circuits. The language includes high-level constructs such as conditionals and a let-in statement that can be used to locally change wires that are otherwise considered to be constant. Termination of recursion is restricted by size-change termination; it must be guaranteed that all recursive calls will be to a strictly smaller circuit size. Reversibility of descriptions is guaranteed with a type system based on linear types. The language is applied to three examples of reversible computations (ALU, linear cosine transformation, and binary adder).The paper also outlines a design flow that ensures garbage- free translation to reversible logic circuits. The flow relies on a reversible combinator language as an intermediate language.",
author = "Thomsen, {Michael Kirkedal}",
year = "2012",
language = "English",
isbn = "978-1-4673-1240-0",
pages = "135--142",
editor = "Morawiec, {Adam } and Hinderscheit, {Jinnie }",
booktitle = "Proceedings of the 2012 Forum on Specification and Design Languages",
publisher = "IEEE",
note = "null ; Conference date: 18-09-2012 Through 20-09-2012",

}

RIS

TY - GEN

T1 - A functional language for describing reversible logic

AU - Thomsen, Michael Kirkedal

PY - 2012

Y1 - 2012

N2 - Reversible logic is a computational model where all gates are logically reversible and combined in circuits such that no values are lost or duplicated. This paper presents a novel functional language that is designed to describe only reversible logic circuits. The language includes high-level constructs such as conditionals and a let-in statement that can be used to locally change wires that are otherwise considered to be constant. Termination of recursion is restricted by size-change termination; it must be guaranteed that all recursive calls will be to a strictly smaller circuit size. Reversibility of descriptions is guaranteed with a type system based on linear types. The language is applied to three examples of reversible computations (ALU, linear cosine transformation, and binary adder).The paper also outlines a design flow that ensures garbage- free translation to reversible logic circuits. The flow relies on a reversible combinator language as an intermediate language.

AB - Reversible logic is a computational model where all gates are logically reversible and combined in circuits such that no values are lost or duplicated. This paper presents a novel functional language that is designed to describe only reversible logic circuits. The language includes high-level constructs such as conditionals and a let-in statement that can be used to locally change wires that are otherwise considered to be constant. Termination of recursion is restricted by size-change termination; it must be guaranteed that all recursive calls will be to a strictly smaller circuit size. Reversibility of descriptions is guaranteed with a type system based on linear types. The language is applied to three examples of reversible computations (ALU, linear cosine transformation, and binary adder).The paper also outlines a design flow that ensures garbage- free translation to reversible logic circuits. The flow relies on a reversible combinator language as an intermediate language.

M3 - Article in proceedings

SN - 978-1-4673-1240-0

SP - 135

EP - 142

BT - Proceedings of the 2012 Forum on Specification and Design Languages

A2 - Morawiec, Adam

A2 - Hinderscheit, Jinnie

PB - IEEE

Y2 - 18 September 2012 through 20 September 2012

ER -

ID: 40367802