English

Scientific Modelling with Coalgebra-Algebra Homomorphisms

Logic in Computer Science 2015-06-25 v1

Abstract

Many recursive functions can be defined elegantly as the unique homomorphisms, between two algebras, two coalgebras, or one each, that are induced by some universal property of a distinguished structure. Besides the well-known applications in recursive functional programming, several basic modes of reasoning about scientific models have been demonstrated to admit such an exact meta-theory. Here we explore the potential of coalgebra--algebra homomorphism that are not a priori unique, for capturing more loosely specifying patterns of scientific modelling. We investigate a pair of dual techniques that leverage (co)monadic structure to obtain reasonable genericity even when no universal properties are given. We show the general applicability of the approach by discussing a surprisingly broad collection of instances from real-world modelling practice.

Keywords

Cite

@article{arxiv.1506.07290,
  title  = {Scientific Modelling with Coalgebra-Algebra Homomorphisms},
  author = {Baltasar Trancón y Widemann and Michael Hauhs},
  journal= {arXiv preprint arXiv:1506.07290},
  year   = {2015}
}
R2 v1 2026-06-22T09:59:13.031Z