Categorical semantics of reversible pattern-matching
From MaRDI portal
Cites work
- \(\mathsf{CoreFun}\): a typed functional reversible core language
- A categorical foundation for structured reversible flowchart languages: soundness and adequacy
- A Representation Theorem for Unique Decomposition Categories
- Computing with semirings and weak rig groupoids
- Condition/decision duality and the internal logic of extensive restriction categories
- En garde! Unguarded iteration for reversible computation in the delay monad
- From symmetric pattern-matching to quantum control
- Fundamentals of reversible flowchart languages
- scientific article; zbMATH DE number 3665176 (Why is no real title available?)
- Information effects
- Inversion, iteration, and the art of dual wielding
- Irreversibility and Heat Generation in the Computing Process
- Join inverse categories and reversible recursion
- Join inverse categories as models of reversible recursion
- Logical Reversibility of Computation
- Restriction categories II: Partial map classification
- Restriction categories III: colimits, partial limits and extensivity
- Restriction categories. I: Categories of partial maps
- Reversible effects as inverse arrows
- Reversible monadic computing
- Reversible Programs Have Reversible Semantics
- Synthesis and optimization of reversible circuits -- a survey
- Toward a curry-Howard equivalence for linear, reversible computation. Work-in-progress
- Towards a reversible functional language
Cited in
(2)
This page was built for publication: Categorical semantics of reversible pattern-matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653745)
