Guard your daggers and traces: properties of guarded (co-)recursion
DOI10.3233/FI-2017-1475zbMATH Open1375.68042arXiv1603.05214MaRDI QIDQ4589616FDOQ4589616
Authors: Stefan Milius, Tadeusz Litak
Publication date: 10 November 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.05214
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theories (e.g., algebraic theories), structure, and semantics (18C10) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Semantics in the theory of computing (68Q55)
Cited In (10)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unguardedness mostly means many solutions
- Unifying guarded and unguarded iteration
- Guarded traced categories
- A metalanguage for guarded iteration
- Title not available (Why is that?)
- Lewis meets Brouwer: constructive strict implication
- Codifying guarded definitions with recursive schemes
- Guard your daggers and traces: on the equational properties of guarded (co-)recursion
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)