An encoding of partial algebras as total algebras

Authors:
Răzvan Diaconescu
Affiliations:
Institute of Mathematics “Simion Stoilow”, Calea Griviţei 21, Bucharest 010702, Romania
Venue:
Information Processing Letters
Year:
2009

Citing 5
Cited 1

Initial computability, algebraic specifications, and partial algebras

Initial computability, algebraic specifications, and partial algebras
Institutions: abstract model theory for specification and programming

Journal of the ACM (JACM)
CASL: the common algebraic specification language

Theoretical Computer Science
Relating CASL with other specification languages: the institution level

Theoretical Computer Science
Institution-independent Model Theory

Institution-independent Model Theory

Untyping typed algebraic structures and colouring proof nets of cyclic linear logic

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic

Quantified Score

Hi-index	0.89

Visualization

Abstract

We introduce a semantic encoding of partial algebras as total algebras through a Horn axiomatization of the existence equality relation interpreted as an algebraic operation. We show that this novel encoding enjoys several important properties that make it a good tool for the execution of partial algebraic specifications through means specific to ordinary algebraic reasoning, such as term rewriting.