Multisorted Tree Algebra

Erick Patrick Zobo; Marcel Fouda Ndjodo

doi:doi:10.11648/j.acm.20140306.12

| Peer-Reviewed

Multisorted Tree Algebra

Erick Patrick Zobo, Marcel Fouda Ndjodo

Published in Applied and Computational Mathematics (Volume 3, Issue 6)

Received: 24 November 2014 Accepted: 5 December 2014 Published: 16 December 2014

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

This paper introduces basic concepts describing a hierarchical algebraic structure called multisorted tree algebra. This structure is constructed by placing multisorted algebra at the bottom of a hierarchy and placing at other intermediate nodes the aggregation of algebras placed at their immediate subordinate nodes. These constructions are different from the one of subalgebras, homomorphic images and product algebras used to characterize varieties in universal algebra theory. The resulting hierarchical algebraic structures cannot be easily classified in common universal algebra varieties. The aggregation method and the fundamental properties of the aggregated algebras have been presented with an illustrative example. Multisorted tree algebras spans multisorted algebra concepts and can be used as modelling framework for building hierarchical abstract data types for information processing in organizations.

Published in	Applied and Computational Mathematics (Volume 3, Issue 6)
DOI	10.11648/j.acm.20140306.12
Page(s)	295-302
Creative Commons	This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright	Copyright © The Author(s), 2024. Published by Science Publishing Group

Keywords

Multisorted Algebra, Hierarchy, Aggregation, Abstract Data Type

References

[1]	K. D. . S. L. Wismath, Universal Algebra and Applications in Theoretical Computer Science, CRC, 2002.
[2]	S. Burris. . H. P. Shankappanavar, A Course in Universal Algebra, the millenium edition Edition, Springer-Verlag, http://www.cs.elte.hu/ ewkiss/univ-algebra.pdf, 1981.
[3]	W. Wechler, Universal Algebra for Computer Scientists, Springer-Verlag, 1992.
[4]	C. Oriat, Etude des speci_cations modulaires: constructions de colimites _nies, diagrammes, isomorphismes, Informatique, Institut National Polytechnique de Grenoble, Laboratoire Logiciels Systmes et Rseaux (LSR-IMAG) (janvier 1996).
[5]	A. Mucka. al., Many-sorted and single-sorted algebras, Algebra Universalis 69 (2013) 171{190.
[6]	J. A. Goguen, Hidden algebraic engineering, in: C. Nahaniv (Ed.), Conference on semi groups and algebraic engineering, University Aisu, 1997.
[7]	J. Goguen, Hidden algebra for software engineering, in: Proc. Conf. Discrete Mathematics and Theoretical Computer Science, Vol. 21 of Australian Computer Science Communications, 1999, pp. 35{59.
[8]	J. Stell, A framework for order-sorted algebra, in: H. Kirchner, C. Ringeissen (Eds.), Algebraic Methodology and Software Technology, Vol. 2422 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2002, pp. 396{411.
[9]	J. J. M. M. Rutten, Universal coalgebra: a theory of systems (2000).
[10]	G. Rosu, Hidden logic, Phd, University of California, San Diego (2000).
[11]	T. V. Zandt, Real-time hierarchical resource allocation, http://faculty.insead.edu/vanzandt/research-orgs/papers/Resource1.pdf.
[12]	M. W. A. Knapp, A formal approach to object-oriented software engineering, Theoretical ComputerScience 285 (2002) 519{560.
[13]	T. V. Zandt, Hierarchical computation of the resource allocation problem, European Economic Review39 (1995) 700{708.
[14]	F. H. Trinkl, Hierarchical resource allocation decisions, Policy Sciences 4 (1973) 211{221.
[15]	J. G. . G. Malcom, A hidden agenda, Theoretical Computer science 245 (2000) 55{101.
[16]	M. Barr, C. Wells, Category Theory for Computer Science, Pintice-Hall International, 1990.
[17]	J. L. Fiadeiro, Cathegories for software engineering, Springer, 2005.
[18]	G. Manzonetto, A. Salibra, From -calculus to universal algebra and back, in: MFCS08, volume 5162 of LNCS, 2008, pp. 479{490.
[19]	V. Capretta, Universal algebra in type theory, in: Theorem Proving in Higher Order Logics, 12th International Conference, TPHOLs '99, volume 1690 of LNCS, Springer-Verlag, 1999, pp. 131{148.
[20]	J. V. Guttag, Abstract data types and the development of data structures, Communication of the ACM6 (1977) 396{404.
[21]	J. A. Goguen, G. Malcolm, Software Engineering with OBJ: algebraic specification in action, Vol. Advances in Formal Methods, Kluwer Academic Publishers, 2000.

Cite This Article

Plain Text BibTeX RIS

APA Style

Erick Patrick Zobo, Marcel Fouda Ndjodo. (2014). Multisorted Tree Algebra. Applied and Computational Mathematics, 3(6), 295-302. https://doi.org/10.11648/j.acm.20140306.12

Copy | Download

ACS Style

Erick Patrick Zobo; Marcel Fouda Ndjodo. Multisorted Tree Algebra. Appl. Comput. Math. 2014, 3(6), 295-302. doi: 10.11648/j.acm.20140306.12

Copy | Download

AMA Style

Erick Patrick Zobo, Marcel Fouda Ndjodo. Multisorted Tree Algebra. Appl Comput Math. 2014;3(6):295-302. doi: 10.11648/j.acm.20140306.12

Copy | Download

@article{10.11648/j.acm.20140306.12,
  author = {Erick Patrick Zobo and Marcel Fouda Ndjodo},
  title = {Multisorted Tree Algebra},
  journal = {Applied and Computational Mathematics},
  volume = {3},
  number = {6},
  pages = {295-302},
  doi = {10.11648/j.acm.20140306.12},
  url = {https://doi.org/10.11648/j.acm.20140306.12},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.acm.20140306.12},
  abstract = {This paper introduces basic concepts describing a hierarchical algebraic structure called multisorted tree algebra. This structure is constructed by placing multisorted algebra at the bottom of a hierarchy and placing at other intermediate nodes the aggregation of algebras placed at their immediate subordinate nodes. These constructions are different from the one of subalgebras, homomorphic images and product algebras used to characterize varieties in universal algebra theory. The resulting hierarchical algebraic structures cannot be easily classified in common universal algebra varieties. The aggregation method and the fundamental properties of the aggregated algebras have been presented with an illustrative example. Multisorted tree algebras spans multisorted algebra concepts and can be used as modelling framework for building hierarchical abstract data types for information processing in organizations.},
 year = {2014}
}

Copy | Download

TY  - JOUR
T1  - Multisorted Tree Algebra
AU  - Erick Patrick Zobo
AU  - Marcel Fouda Ndjodo
Y1  - 2014/12/16
PY  - 2014
N1  - https://doi.org/10.11648/j.acm.20140306.12
DO  - 10.11648/j.acm.20140306.12
T2  - Applied and Computational Mathematics
JF  - Applied and Computational Mathematics
JO  - Applied and Computational Mathematics
SP  - 295
EP  - 302
PB  - Science Publishing Group
SN  - 2328-5613
UR  - https://doi.org/10.11648/j.acm.20140306.12
AB  - This paper introduces basic concepts describing a hierarchical algebraic structure called multisorted tree algebra. This structure is constructed by placing multisorted algebra at the bottom of a hierarchy and placing at other intermediate nodes the aggregation of algebras placed at their immediate subordinate nodes. These constructions are different from the one of subalgebras, homomorphic images and product algebras used to characterize varieties in universal algebra theory. The resulting hierarchical algebraic structures cannot be easily classified in common universal algebra varieties. The aggregation method and the fundamental properties of the aggregated algebras have been presented with an illustrative example. Multisorted tree algebras spans multisorted algebra concepts and can be used as modelling framework for building hierarchical abstract data types for information processing in organizations.
VL  - 3
IS  - 6
ER  -

Copy | Download

Author Information

Erick Patrick Zobo

Department of Computer Sciences and Education Technologies (DITE), University of Yaounde I Yaounde, Cameroon
Marcel Fouda Ndjodo

Department of Computer Sciences and Education Technologies (DITE), University of Yaounde I Yaounde, Cameroon

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

Erick Patrick Zobo, Marcel Fouda Ndjodo. (2014). Multisorted Tree Algebra. Applied and Computational Mathematics, 3(6), 295-302. https://doi.org/10.11648/j.acm.20140306.12

Copy | Download

ACS Style

Erick Patrick Zobo; Marcel Fouda Ndjodo. Multisorted Tree Algebra. Appl. Comput. Math. 2014, 3(6), 295-302. doi: 10.11648/j.acm.20140306.12

Copy | Download

AMA Style

Erick Patrick Zobo, Marcel Fouda Ndjodo. Multisorted Tree Algebra. Appl Comput Math. 2014;3(6):295-302. doi: 10.11648/j.acm.20140306.12

Copy | Download

@article{10.11648/j.acm.20140306.12,
  author = {Erick Patrick Zobo and Marcel Fouda Ndjodo},
  title = {Multisorted Tree Algebra},
  journal = {Applied and Computational Mathematics},
  volume = {3},
  number = {6},
  pages = {295-302},
  doi = {10.11648/j.acm.20140306.12},
  url = {https://doi.org/10.11648/j.acm.20140306.12},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.acm.20140306.12},
  abstract = {This paper introduces basic concepts describing a hierarchical algebraic structure called multisorted tree algebra. This structure is constructed by placing multisorted algebra at the bottom of a hierarchy and placing at other intermediate nodes the aggregation of algebras placed at their immediate subordinate nodes. These constructions are different from the one of subalgebras, homomorphic images and product algebras used to characterize varieties in universal algebra theory. The resulting hierarchical algebraic structures cannot be easily classified in common universal algebra varieties. The aggregation method and the fundamental properties of the aggregated algebras have been presented with an illustrative example. Multisorted tree algebras spans multisorted algebra concepts and can be used as modelling framework for building hierarchical abstract data types for information processing in organizations.},
 year = {2014}
}

Copy | Download

TY  - JOUR
T1  - Multisorted Tree Algebra
AU  - Erick Patrick Zobo
AU  - Marcel Fouda Ndjodo
Y1  - 2014/12/16
PY  - 2014
N1  - https://doi.org/10.11648/j.acm.20140306.12
DO  - 10.11648/j.acm.20140306.12
T2  - Applied and Computational Mathematics
JF  - Applied and Computational Mathematics
JO  - Applied and Computational Mathematics
SP  - 295
EP  - 302
PB  - Science Publishing Group
SN  - 2328-5613
UR  - https://doi.org/10.11648/j.acm.20140306.12
AB  - This paper introduces basic concepts describing a hierarchical algebraic structure called multisorted tree algebra. This structure is constructed by placing multisorted algebra at the bottom of a hierarchy and placing at other intermediate nodes the aggregation of algebras placed at their immediate subordinate nodes. These constructions are different from the one of subalgebras, homomorphic images and product algebras used to characterize varieties in universal algebra theory. The resulting hierarchical algebraic structures cannot be easily classified in common universal algebra varieties. The aggregation method and the fundamental properties of the aggregated algebras have been presented with an illustrative example. Multisorted tree algebras spans multisorted algebra concepts and can be used as modelling framework for building hierarchical abstract data types for information processing in organizations.
VL  - 3
IS  - 6
ER  -

Copy | Download