scientific article

Publication date: 26 June 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

algebraically complete categories algebraic completeness endofunctors category of \(t\)-algebras fixed objects

Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Categorical structures (18D99)

Related Items

μ-Bicomplete Categories and Parity Games ⋮ Computational adequacy via ‘mixed’ inductive definitions ⋮ Terminal coalgebras in well-founded set theory ⋮ Parametrized fixed points and their applications to session types ⋮ Computational adequacy for recursive types in models of intuitionistic set theory ⋮ Recursively defined metric spaces without contraction ⋮ The S-replete construction ⋮ The convex powerdomain in a category of posets realized by cpos ⋮ Categorical fixed point calculus ⋮ Partial map classifiers and partial cartesian closed categories ⋮ Game theoretic analysis of call-by-value computation ⋮ Equational properties of iteration in algebraically complete categories ⋮ A note on ``Extensional PERs ⋮ The equational logic of fixed points ⋮ Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure ⋮ On the equational definition of the least prefixed point. ⋮ A general theory of self-similarity ⋮ Unnamed Item ⋮ Relative full completeness for bicategorical Cartesian closed structure ⋮ Unnamed Item ⋮ Coalgebras in functional programming and type theory ⋮ Unnamed Item ⋮ Game-theoretic analysis of call-by-value computation ⋮ Weighted models for higher-order computation ⋮ T.T.F. theories in abelian categories ⋮ A T.T.F. theory for short exact sequences ⋮ Semantics and logic of object calculi ⋮ Two models of synthetic domain theory ⋮ A presentation of the initial lift-algebra ⋮ New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic ⋮ Introduction: A personal tribute to Peter Freyd and Bill Lawvere ⋮ Synthetic domain theory and models of linear Abadi {\&} Plotkin logic ⋮ Algebraically compact functors ⋮ Recursive coalgebras from comonads ⋮ Least and Greatest Fixpoints in Game Semantics ⋮ Induction and recursion on the partial real line with applications to Real PCF ⋮ Unnamed Item ⋮ Unique, guarded fixed points in an additive setting ⋮ Axioms and (counter)examples in synthetic domain theory ⋮ Games and full abstraction for FPC. ⋮ A Convenient Category of Domains ⋮ A co-induction principle for recursively defined domains ⋮ Fixpoint operators for domain equations ⋮ Fixed points of Scott continuous self-maps ⋮ Final semantics for a higher order concurrent language