Publication:3978971
From MaRDI portal
zbMath0815.18005MaRDI QIDQ3978971
Publication date: 26 June 1992
algebraically complete categories; algebraic completeness; endofunctors; category of \(t\)-algebras; fixed objects
68Q55: Semantics in the theory of computing
68Q65: Abstract data types; algebraic specification
18A35: Categories admitting limits (complete categories), functors preserving limits, completions
18D99: Categorical structures
Related Items
μ-Bicomplete Categories and Parity Games, Two models of synthetic domain theory, A presentation of the initial lift-algebra, Synthetic domain theory and models of linear Abadi {\&} Plotkin logic, Equational properties of iteration in algebraically complete categories, New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic, Algebraically compact functors, Induction and recursion on the partial real line with applications to Real PCF, A co-induction principle for recursively defined domains, Partial map classifiers and partial cartesian closed categories, The equational logic of fixed points, On the equational definition of the least prefixed point., Semantics and logic of object calculi, Axioms and (counter)examples in synthetic domain theory, Fixpoint operators for domain equations, Fixed points of Scott continuous self-maps, Games and full abstraction for FPC., Computational adequacy for recursive types in models of intuitionistic set theory, Game-theoretic analysis of call-by-value computation, Terminal coalgebras in well-founded set theory, Recursively defined metric spaces without contraction, Recursive coalgebras from comonads, Least and Greatest Fixpoints in Game Semantics, T.T.F. theories in abelian categories, A T.T.F. theory for short exact sequences
