Fixed Points In Quantitative Semantics

  title={Fixed Points In Quantitative Semantics},
  author={J. Laird},
  journal={2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
We describe an interpretation of recursive computation in a symmetric monoidal category with infinite biproducts and cofree commutative comonoids (for instance, the category of free modules over a complete semiring). Such categories play a significant role in "quantitative" models of computation: they bear a canonical complete monoid enrichment, but may not be cpo-enriched, making standard techniques for reasoning about fixed points unavailable. By constructing a bifree algebra for the cofree… CONTINUE READING


Publications referenced by this paper.

Similar Papers

Loading similar papers…