Describing and Optimising Reversible Logic Using a Functional Language

DOI10.1007/978-3-642-34407-7_10zbMath1348.68054OpenAlexW1553403712MaRDI QIDQ2830051

Michael Kirkedal Thomsen

Publication date: 9 November 2016

Published in: Implementation and Application of Functional Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-34407-7_10

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items (2)

Checking Reversibility of Boolean Functions ⋮ Ricercar: A Language for Describing and Rewriting Reversible Circuits with Ancillae and Its Permutation Semantics

Uses Software

• SyReC
• muFP

This page was built for publication: Describing and Optimising Reversible Logic Using a Functional Language