Computing with Semirings and Weak Rig Groupoids
From MaRDI portal
Publication:2802473
DOI10.1007/978-3-662-49498-1_6zbMath1335.68048OpenAlexW2463458990WikidataQ60712708 ScholiaQ60712708MaRDI QIDQ2802473
Publication date: 26 April 2016
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49498-1_6
Related Items (2)
From reversible programs to univalent universes and back ⋮ Join inverse categories and reversible recursion
Uses Software
Cites Work
- Linear logic
- Categorification, term rewriting and the Knuth-Bendix procedure
- Conservative logic
- Seven trees in one
- Remarks on isomorphisms in typed lambda calculi with empty and sum types
- An objective representation of the Gaussian integers
- From Reversible to Irreversible Computations
- Information effects
- Physics, Topology, Logic and Computation: A Rosetta Stone
- Isomorphisms of generic recursive polynomial types
- Isomorphic Interpreters from Logically Reversible Abstract Machines
- Irreversibility and Heat Generation in the Computing Process
- Open-graphs and monoidal theories
- Using types as search keys in function libraries
- Abstract Tensor Systems as Monoidal Categories
- Logical Reversibility of Computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing with Semirings and Weak Rig Groupoids
