Reversible combinatory logic
From MaRDI portal
Publication:5482262
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
Cited in
(9)- The \(\aleph \)-calculus. A declarative model of reversible programming
- On reversible combinatory logic
- Equality in lambda calculus. Weak universality in category theory and reversible computations
- The involutions-as-principal types/application-as-unification analogy
- Describing and Optimising Reversible Logic Using a Functional Language
- Reversible computation in term rewriting
- From reversible programs to univalent universes and back
- lambda!-calculus, Intersection Types, and Involutions
- Fundamentals of reversible flowchart languages
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)