Computing with semirings and weak rig groupoids
From MaRDI portal
Publication:2802473
Recommendations
Cites work
- scientific article; zbMATH DE number 2185716 (Why is no real title available?)
- scientific article; zbMATH DE number 3692653 (Why is no real title available?)
- scientific article; zbMATH DE number 1303764 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- Abstract tensor systems as monoidal categories
- An objective representation of the Gaussian integers
- Categorification, term rewriting and the Knuth-Bendix procedure
- Conservative logic
- From reversible to irreversible computations
- Information effects
- Irreversibility and Heat Generation in the Computing Process
- Isomorphic interpreters from logically reversible abstract machines
- Isomorphisms of generic recursive polynomial types
- Linear logic
- Logical Reversibility of Computation
- Open-graphs and monoidal theories
- Physics, Topology, Logic and Computation: A Rosetta Stone
- Remarks on isomorphisms in typed lambda calculi with empty and sum types
- Seven trees in one
- Using types as search keys in function libraries
Cited in
(5)
This page was built for publication: Computing with semirings and weak rig groupoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802473)