Guard your daggers and traces: properties of guarded (co-)recursion

From MaRDI portal
Publication:4589616

DOI10.3233/FI-2017-1475zbMATH Open1375.68042arXiv1603.05214MaRDI QIDQ4589616FDOQ4589616


Authors: Stefan Milius, Tadeusz Litak Edit this on Wikidata


Publication date: 10 November 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Abstract: Motivated by the recent interest in models of guarded (co-)recursion, we study their equational properties. We formulate axioms for guarded fixpoint operators generalizing the axioms of iteration theories of Bloom and 'Esik. Models of these axioms include both standard (e.g., cpo-based) models of iteration theories and models of guarded recursion such as complete metric spaces or the topos of trees studied by Birkedal et al. We show that the standard result on the satisfaction of all Conway axioms by a unique dagger operation generalizes to the guarded setting. We also introduce the notion of guarded trace operator on a category, and we prove that guarded trace and guarded fixpoint operators are in one-to-one correspondence. Our results are intended as first steps leading, hopefully, towards future description of classifying theories for guarded recursion.


Full work available at URL: https://arxiv.org/abs/1603.05214




Recommendations




Cited In (10)





This page was built for publication: Guard your daggers and traces: properties of guarded (co-)recursion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589616)