DeepAI AI Chat
Log In Sign Up

Non-determinsitic algebraic rewriting as adjunction

04/26/2022
by   Răzvan Diaconescu, et al.
Yahoo! Inc.
0

We develop a general model theoretic semantics to rewriting beyond the usual confluence and termination assumptions. This is based on preordered algebra which is a model theory that extends many sorted algebra. In this framework we characterise rewriting in arbitrary algebras rather than term algebras (called algebraic rewriting) as a persistent adjunction and use this result, on the one hand for proving the soundness and the completeness of an abstract computational model of rewriting that underlies the non-deterministic programming with Maude and CafeOBJ, and on the other hand for developing a compositionality result for algebraic rewriting in the context of the pushout-based modularisation technique.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/16/2021

Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness

Guarded Kleene Algebra with Tests (GKAT) is an efficient fragment of KAT...
04/23/2021

Algebraic combinatory models

We introduce an equationally definable counterpart of the notion of comb...
10/31/2019

A note on commutative Kleene algebra

In this paper we present a detailed proof of an important result of alge...
02/14/2022

A formal algebraic approach for the quantitative modeling of connectors in architectures

In this paper we propose an algebraic formalization of connectors in the...
04/06/2022

An Algebraic Approach to Learning and Grounding

We consider the problem of learning the semantics of composite algebraic...
02/25/2016

A Neutrosophic Recommender System for Medical Diagnosis Based on Algebraic Neutrosophic Measures

Neutrosophic set has the ability to handle uncertain, incomplete, incons...
06/11/2021

Time Warps, from Algebra to Algorithms

Graded modalities have been proposed in recent work on programming langu...