An encoding of partial algebras as total algebras
by
Răzvan Diaconescu
| Venue: | Information Processing Letters |
| Citations: | 2 - 2 self |
BibTeX
@ARTICLE{Diaconescu_anencoding,
author = {Răzvan Diaconescu},
title = {An encoding of partial algebras as total algebras},
journal = {Information Processing Letters},
year = {},
pages = {10--1016}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
Citations
| 425 | Institutions: Abstract model theory for specification and programming - Goguen, Burstall - 1992 |
| 156 | On the structure of abstract algebras - Birkhoff - 1935 |
| 51 | Institution morphisms - Goguen, Ro¸su - 2002 |
| 44 | A Model Theoretic Oriented Approach to Partial Algebras: Introduction to Theory and Application - Burmeister - 1986 |
| 35 | Institution-independent Model Theory. Birkhäuser - Diaconescu - 2008 |
| 30 | Relating casl with other specification languages: the institution level - MOSSAKOWSKI |
| 12 | and José Meseguer. Completeness of many-sorted equational logic - Goguen - 1982 |
| 11 | Andrzej Tarlecki. CASL: The common algebraic specification language - Astesiano, Bidoit, et al. |
| 11 | On the principle of the excluded middle - Kolmogorov - 1971 |
| 9 | Răzvan Diaconescu, and Andrzej Tarlecki. What is a logic - Mossakowski, Goguen - 2005 |
| 7 | Petria and Răzvan Diaconescu. Abstract Beth definability in institutions - Marius - 2006 |
| 4 | Birkhoff completeness in institutions - Codescu, Găină |
