Reversible combinatory logic

DOI10.1017/S0960129506005391zbMATH Open1103.03015OpenAlexW2129644491MaRDI QIDQ5482262FDOQ5482262

Authors: Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky 

Publication date: 28 August 2006

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129506005391

Recommendations

• On reversible combinatory logic
• Reversible computations in logic programming
• Logic of reversible automata
• Reversible computation in term rewriting
• A classical propositional logic for reasoning about reversible logic circuits
• Describing and Optimising Reversible Logic Using a Functional Language
• scientific article; zbMATH DE number 993359
• Reversible monadic computing
• Constructive reversible logic synthesis for Boolean functions with special properties

zbMATH Keywords

reversibilityalgebraic modelclassical combinatory logicreversible computational models

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (9)

• From reversible programs to univalent universes and back
• lambda!-calculus, Intersection Types, and Involutions
• The involutions-as-principal types/application-as-unification analogy
• Equality in lambda calculus. Weak universality in category theory and reversible computations
• Fundamentals of reversible flowchart languages
• On reversible combinatory logic
• Reversible computation in term rewriting
• The \(\aleph \)-calculus. A declarative model of reversible programming
• Describing and Optimising Reversible Logic Using a Functional Language

This page was built for publication: Reversible combinatory logic

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