Conditionally reversible computations and weak universality in category theory

DOI10.1007/S10958-014-1955-3zbMATH Open1311.18003OpenAlexW2056270294MaRDI QIDQ2256643FDOQ2256643

Authors: S. N. Baranov, Serguei V. Solov'ev Edit this on Wikidata

Publication date: 20 February 2015

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-014-1955-3

Recommendations

• Equality in lambda calculus. Weak universality in category theory and reversible computations
• Towards a categorical representation of reversible event structures
• scientific article; zbMATH DE number 3999258
• Reversible monadic computing
• Join inverse categories and reversible recursion

zbMATH Keywords

conditionally reversible computationextensional and intensional equalityweak universality in categories

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Abstract and axiomatic computability and recursion theory (03D75) Foundations, relations to logic and deductive systems (18A15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Synthesis and optimization of reversible circuits -- a survey
• Title not available (Why is that?)
• Isomorphisms of simple inductive types through extensional rewriting

Cited In (4)

• Identities in modular arithmetic from reversible coherence operations
• Equality in lambda calculus. Weak universality in category theory and reversible computations
• Eta-rules in Martin-Löf type theory
• Contextual equivalences in configuration structures and reversibility

This page was built for publication: Conditionally reversible computations and weak universality in category theory

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