Electronic Notes in Theoretical Computer Science · 1999 · 33 citations · 11 references
Natural SciencesComputer ScienceMathematicsAlgebraSet TheoryTheory Of ComputationCategory TheoryFormal SemanticsModel TheoryProof TheoryBisimulation In LogicCategorical SemanticsCoinductionFixpoint ComputationSet-theoretic FoundationsSet-theoretic ModelingSet-theoretic ProofsTarski Fixed Point Theorem
We investigate the relation between the set-theoretical description of coinduction based on Tarski Fixpoint Theorem, and the categorical description of coinduction based on coalgebras. In particular, we introduce set-theoretic generalizations of the coinduction proof principle, in the spirit of Milner's bisimulation “up-to”, and we discuss categorical counterparts for these. Moreover, we investigate the connection between these and the equivalences induced by T-coiterative functions. These are morphisms into final coalgebras, satisfying the T-coiteration scheme, which is a generalization of the corecursion scheme. We show how to describe coalgebraic F-bisimulations as set-theoretical ones. A list of examples of set-theoretic coinductions which appear not to be easily amenable to coalgebraic terms are discussed.
11
A calculus of mobile processes, I
Robin Milner, Joachim Parrow, David Walker · Information and Computation · 1992 · 2.8K citations · Full text
Calculi for synchrony and asynchrony
Robin Milner · Theoretical Computer Science · 1983 · 898 citations · Full text
Towards a mathematical operational semantics
Daniele Turi, Gordon Plotkin · 2002 · 369 citations · Full text
Relational Properties of Domains
Andrew M. Pitts · Information and Computation · 1996 · 190 citations