Conditionally reversible computations and weak universality in category theory

DOI10.1007/S10958-014-1955-3zbMath1311.18003OpenAlexW2056270294MaRDI QIDQ2256643

S. N. Baranov, Serguei V. Solov'ev

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

zbMATH Keywords

conditionally reversible computationextensional and intensional equalityweak universality in categories

Mathematics Subject Classification ID

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

Related Items (1)

ETA-RULES IN MARTIN-LÖF TYPE THEORY

Cites Work

• Synthesis and optimization of reversible circuits—a survey
• Isomorphisms of simple inductive types through extensional rewriting
• Unnamed Item
• Unnamed Item
• Unnamed Item

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