Describing and Optimising Reversible Logic Using a Functional Language

DOI10.1007/978-3-642-34407-7_10MaRDI QIDQ2830051zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Towards a reversible functional language
• Generating reversible circuits from higher-order functional programs
• Reversible computations in logic programming
• Reversible combinatory logic
• On reversible combinatory logic
• Mathematics of Program Construction
• Reversible computing from a programming language perspective
• Constructive reversible logic synthesis for Boolean functions with special properties
• On the expressivity of total reversible programming languages
• Reversible computation in term rewriting

Cited in

(6)

• Towards VHDL-based design of reversible circuits. Work in progress report
• \(\mathsf{CoreFun}\): a typed functional reversible core language
• Ricercar: a language for describing and rewriting reversible circuits with ancillae and its permutation semantics
• Checking Reversibility of Boolean Functions
• A reflective functional language for hardware design and theorem proving
• Reversible combinatory logic

Describes a project that uses

Uses Software

• muFP
• SyReC

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830051)