A characterization of the least-fixed-point operator by dinaturality
DOI10.1016/0304-3975(93)90112-7zbMATH Open0788.18007OpenAlexW2099628768MaRDI QIDQ685386FDOQ685386
Authors: Alex Simpson
Publication date: 17 October 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90112-7
Recommendations
Cartesian closed categoriesdomain theoryalgebraic domainscontinuous domainscategory of domainscontinuous cposfixpoint operators
Continuous lattices and posets, applications (06B35) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Semantics in the theory of computing (68Q55)
Cites Work
Cited In (14)
- Title not available (Why is that?)
- Fixpoint operators for domain equations
- G-dinaturality.
- Feedback for linearly distributive categories: Traces and fixpoints
- Continuously generated fixed points
- Equational properties of iteration in algebraically complete categories
- The equational logic of fixed points
- Composing dinatural transformations: towards a calculus of substitution
- Title not available (Why is that?)
- Unique, guarded fixed points in an additive setting: extended abstract
- Fixed-point operations on ccc's. I
- On traced monoidal closed categories
- Title not available (Why is that?)
- On Compositionality of Dinatural Transformations
This page was built for publication: A characterization of the least-fixed-point operator by dinaturality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685386)