A uniform approach to inductive posets and inductive closure
From MaRDI portal
Publication:809105
DOI10.1016/0304-3975(78)90040-3zbMath0732.06001MaRDI QIDQ809105
Eric G. Wagner, Jesse B. Wright, James W. Thatcher
Publication date: 1978
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(78)90040-3
fixed-point semantics for programming languages; inductive closure; inductive posets; Z-completeness; Z-continuity; Z-set
06A06: Partial orders, general
18A40: Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.)
68Q55: Semantics in the theory of computing
06A15: Galois correspondences, closure operators (in relation to ordered sets)
Related Items
The glueing construction and lax limits, Combining data type and recursive process specifications using projection algebras, Ideals in ordered sets, a unifying approach, Fundamental properties of infinite trees, Order completion monads, The category of Z-continuous posets, Posets isomorphic to their extensions, The Birkhoff variety theorem for continuous algebras, Equivalences and transformations of regular systems - applications to recursive program schemes and grammars, On the algebra of order, Varieties of chain-complete algebras, Tree constructions of free continuous algebras, A dual problem to least fixed points, Embedding metric spaces into CPO's, Uniformly constructive monads, Bigeneration in complete lattices and principal separation in ordered sets, General Stone duality., Completions for partially ordered semigroups, \({\mathbf Z}\)-continuous posets, Monotone Relations, Fixed Points and Recursive Definitions, ORDER EXTENSIONS AS ADJOINT FUNCTORS, Unnamed Item, Infinite trees in normal form and recursive equations having a unique solution, Quasi-Atoms and Complete Distributivity
Cites Work
