The bicategory-theoretic solution of recursive domain equations
DOI10.1016/J.ENTCS.2007.02.008zbMATH Open1277.68117OpenAlexW2036542851MaRDI QIDQ2864151FDOQ2864151
Marcelo P. Fiore, Gian Luca Cattani
Publication date: 6 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2007.02.008
Recommendations
domain theoryalgebraic completenessrecursive domain equationsalgebraic compactnessaxiomatic domain theorybicategorical limit/colimit coincidencebicategory theory
Continuous lattices and posets, applications (06B35) Semantics in the theory of computing (68Q55) Preadditive, additive categories (18E05)
Cites Work
- The Category-Theoretic Solution of Recursive Domain Equations
- Title not available (Why is that?)
- Introduction to bicategories
- Two-dimensional monad theory
- Title not available (Why is that?)
- Cauchy characterization of enriched categories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topical categories of domains
- Title not available (Why is that?)
- A fixpoint theorem for complete categories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic specification of data types: A synthetic approach
- Axiomatic Domain Theory in Categories of Partial Maps
- A categorical generalization of Scott domains
- Fixed-point constructions in order-enriched categories
- On categories generalizing universal domains
- Title not available (Why is that?)
- Categorical domain theory: Scott topology, powercategories, coherent categories
Cited In (3)
This page was built for publication: The bicategory-theoretic solution of recursive domain equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864151)