Show simple item record

State based systems are coalgebras

dc.creatorPeter Gumm, H.
dc.date2003-06-01
dc.date.accessioned2019-05-03T12:36:53Z
dc.date.available2019-05-03T12:36:53Z
dc.identifierhttp://revistas.ufro.cl/ojs/index.php/cubo/article/view/1698
dc.identifier.urihttp://revistaschilenas.uchile.cl/handle/2250/84423
dc.descriptionUniversal coalgebra is a mathematical theory of state based systems, which in many respects is dual to universal algebra. Equality must be replaced by indistinguishability. Coinduction replaces induction as a proof principle and maps are defined by co-recursion. In this (entirely self-contained) paper we give a first glimpse at the general theory and focus on some applications in Computer Science.en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad de La Frontera. Temuco, Chile.en-US
dc.relationhttp://revistas.ufro.cl/ojs/index.php/cubo/article/view/1698/1550
dc.sourceCUBO, A Mathematical Journal; Vol. 5 Núm. 2 (2003): CUBO, Matemática Educacional; 239–262es-ES
dc.sourceCUBO, A Mathematical Journal; Vol 5 No 2 (2003): CUBO, Matemática Educacional; 239–262en-US
dc.source0719-0646
dc.source0716-7776
dc.titleState based systems are coalgebrasen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion


This item appears in the following Collection(s)

Show simple item record