Axiomatization of if-then-else over monoids of possibly non-halting programs and tests
Logic in Computer Science
2017-02-21 v1
Abstract
In order to study the axiomatization of the if-then-else construct over possibly non-halting programs and tests, the notion of -sets was introduced in the literature by considering the tests from an abstract -algebra. This paper extends the notion of -sets to -monoids which include the composition of programs as well as composition of programs with tests. For the class of -monoids where the -algebras are adas a canonical representation in terms of functional -monoids is obtained.
Keywords
Cite
@article{arxiv.1702.05752,
title = {Axiomatization of if-then-else over monoids of possibly non-halting programs and tests},
author = {Gayatri Panicker and K. V. Krishna and Purandar Bhaduri},
journal= {arXiv preprint arXiv:1702.05752},
year = {2017}
}