<--- Back to Details
First PageDocument Content
Category theory / Theoretical computer science / Mathematics / Bisimulation / F-coalgebra / Coinduction / Functor / Coalgebra / Universal property
Date: 2012-10-10 03:52:07
Category theory
Theoretical computer science
Mathematics
Bisimulation
F-coalgebra
Coinduction
Functor
Coalgebra
Universal property

1. Bisimulation everywhere 2. The power of coinduction 3. More bisimulations, still

Add to Reading List

Source URL: events.inf.ed.ac.uk

Download Document from Source Website

File Size: 1,12 MB

Share Document on Facebook

Similar Documents

1. Bisimulation everywhere  2. The power of coinduction 3. More bisimulations, still

1. Bisimulation everywhere 2. The power of coinduction 3. More bisimulations, still

DocID: 1qXxc - View Document

Journal of Pure and Applied Algebra – 168 www.elsevier.com/locate/jpaa Splittings of bicommutative Hopf algebras Nitu Kitchlooa; c , Gerd Lauresb; d;1 , W. Stephen Wilsona;∗ a Department

Journal of Pure and Applied Algebra – 168 www.elsevier.com/locate/jpaa Splittings of bicommutative Hopf algebras Nitu Kitchlooa; c , Gerd Lauresb; d;1 , W. Stephen Wilsona;∗ a Department

DocID: 1pZzu - View Document

Foundational, Compositional (Co)datatypes for Higher-Order Logic Category Theory Applied to Theorem Proving Dmitriy Traytel Technische Universität München Munich, Germany

Foundational, Compositional (Co)datatypes for Higher-Order Logic Category Theory Applied to Theorem Proving Dmitriy Traytel Technische Universität München Munich, Germany

DocID: 1oU48 - View Document

Robin Milner and Mathematics Glynn Winskel 1. Background, Robin’s intellectual position(s) 2. Robin’s attitude, contributions and potential contributions to Mathematics 3. Robin’s ideas and concurrent strategies

Robin Milner and Mathematics Glynn Winskel 1. Background, Robin’s intellectual position(s) 2. Robin’s attitude, contributions and potential contributions to Mathematics 3. Robin’s ideas and concurrent strategies

DocID: 1oMN9 - View Document

Towards a Unified Treatment of Induction, I: The General Recursion Theorem Paul Taylor 1995–6 Abstract The recursive construction of a function f : A → Θ consists, paradigmatically, of finding

Towards a Unified Treatment of Induction, I: The General Recursion Theorem Paul Taylor 1995–6 Abstract The recursive construction of a function f : A → Θ consists, paradigmatically, of finding

DocID: 1orDS - View Document