Towards an Algebra of Computon Spaces
Logic in Computer Science
2022-06-06 v1 Formal Languages and Automata Theory
Abstract
Compositionality is a key property for dealing with complexity, which has been studied from many points of view in diverse fields. Particularly, the composition of individual computations (or programs) has been widely studied almost since the inception of computer science. Unlike existing composition theories, this paper presents an algebraic model not for composing individual programs but for inductively composing spaces of sequential and/or parallel constructs. We particularly describe the semantics of the proposed model and present an abstract example to demonstrate its application.
Cite
@article{arxiv.2206.01694,
title = {Towards an Algebra of Computon Spaces},
author = {Damian Arellanes},
journal= {arXiv preprint arXiv:2206.01694},
year = {2022}
}