Continuous Functions on Final Comodels of Free Algebraic Theories

11/21/2022
by   Tomoya Yoshida, et al.
0

In 2009, Ghani, Hancock and Pattinson gave a tree-like representation of stream processors A^ℕ→ B^ℕ. In 2021, Garner showed that this representation can be established in terms of algebraic theory and comodels: the set of infinite streams A^ℕ is the final comodel of the algebraic theory of A-valued input 𝕋_A and the set of stream processors 𝑇𝑜𝑝(A^ℕ,B^ℕ) can be seen as the final 𝕋_A-𝕋_B-bimodel. In this paper, we generalize Garner's results to the case of free algebraic theories.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/10/2021

Stream processors and comodels

In 2009, Ghani, Hancock and Pattinson gave a coalgebraic characterisatio...
research
10/21/2021

Fuzzy Algebraic Theories

In this work we propose a formal system for fuzzy algebraic reasoning. T...
research
02/23/2019

Algebraic Type Theory and Universe Hierarchies

It is commonly believed that algebraic notions of type theory support on...
research
05/28/2021

A polynomial composites and monoid domains as algebraic structures and their applications

This paper contains the results collected so far on polynomial composite...
research
09/23/2020

Behavioral Specification Theories: an Algebraic Taxonomy

We develop a taxonomy of different behavioral specification theories and...
research
10/10/2011

Supporting Temporal Reasoning by Mapping Calendar Expressions to Minimal Periodic Sets

In the recent years several research efforts have focused on the concept...
research
02/14/2020

Abstract rewriting internalized

In traditional rewriting theory, one studies a set of terms up to a set ...

Please sign up or login with your details

Forgot password? Click here to reset