Towards an Algebra of Computon Spaces

05/31/2022
by   Damian Arellanes, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/12/2020

Finite Horn Monoids via Propositional Horn Theory Composition

Describing complex objects as the composition of elementary ones is a co...
research
08/11/2021

Composition Machines: Programming Self-Organising Software Models for the Emergence of Sequential Program Spaces

We are entering a new era in which software systems are becoming more an...
research
09/13/2016

Toward an Algebraic Theory of Systems

We propose the concept of a system algebra with a parallel composition o...
research
02/06/2020

PaSe: An Extensible and Inspectable DSL for Micro-Animations

This paper presents PaSe, an extensible and inspectable DSL embedded in ...
research
04/25/2021

Sequential composition of answer set programs

Non-monotonic reasoning is an essential part of human intelligence promi...
research
01/25/2016

A Label Semantics Approach to Linguistic Hedges

We introduce a model for the linguistic hedges `very' and `quite' within...
research
09/23/2021

Pregroup Grammars, their Syntax and Semantics

Pregroup grammars were developed in 1999 and stayed Lambek's preferred a...

Please sign up or login with your details

Forgot password? Click here to reset