A characterization of the least-fixed-point operator by dinaturality

DOI10.1016/0304-3975(93)90112-7zbMath0788.18007OpenAlexW2099628768MaRDI QIDQ685386

Alex K. 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

zbMATH Keywords

Cartesian closed categoriesdomain theoryalgebraic domainscontinuous domainscategory of domainscontinuous cposfixpoint operators

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Continuous lattices and posets, applications (06B35) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15)

Related Items (8)

Equational properties of iteration in algebraically complete categories ⋮ The equational logic of fixed points ⋮ Fixed-point operations on ccc's. I ⋮ Composing dinatural transformations: towards a calculus of substitution ⋮ On traced monoidal closed categories ⋮ On Compositionality of Dinatural Transformations ⋮ Unique, guarded fixed points in an additive setting ⋮ Feedback for linearly distributive categories: Traces and fixpoints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cartesian closed categories of algebraic cpos
• Functorial polymorphism
• The largest Cartesian closed category of domains
• Categorical fixed point semantics

This page was built for publication: A characterization of the least-fixed-point operator by dinaturality