Published in Volume XVIII, 2008, pages 35-61

Authors: J.A. Bergstra, A. Ponse and M.B. Van Der Zwaag


We introduce a calculus for tuplices, which are expressions that generalize matrices and vectors. Tuplices have an underlying data type for quantities that are taken from a zero-totalized field. We start with the core tuplix calculus CTC for entries and tests, which are combined using conjunctive composition. We define a standard model and prove that CTC is relatively complete with respect to it. The core calculus is extended with operators for choice, information hiding, scalar multiplication, clearing and encapsulation. We provide two examples of applications; one on incremental financial budgeting, and one on modular financial budget design.

Full Text (PDF)


[1] J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18, Cambidge University Press, 1990.

[2] BBRT,

[3] J.A. Bergstra, Y. Hirshfeld, and J.V. Tucker. Meadows and the equational specification of division. Theoretical Computer Science (2009), doi:10.1016/j.tcs.2008.12.015.

[4] J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Control, 60(1-3):109-137, 1984.

[5] J.A. Bergstra and C.A. Middelburg Parallel processes with implicit computational capital. Electronic Notes in Theoretical Computer Science, 209:55-81, 2008.

[6] J.A. Bergstra, S. Nolst Trenit´e, and M.B. van der Zwaag. Towards a formalization of budgets. arXiv:0802.3617v1 at, 2008.

[7] J.A. Bergstra and A. Ponse. Interface groups and financial transfer architectures. arXiv:0707.1639v1 at, July 2007.

[8] J.A. Bergstra and J.V. Tucker. The rational numbers as an abstract data type. Journal of the ACM, 54(2), 2007.

[9] Ph.I. Elsas. Computational Auditing. PhD thesis, Vrije Universiteit, Amsterdam, 1996.

[10] W. Fokkink. Introduction to Process Algebra. Texts in Theoretical Computer Science, Springer-Verlag, 2000.

[11] P.R. Griffioen, Ph.I. Elsas, and R.P. van de Riet. Analyzing enterprises: the value cycle approach. In: Database and Expert Systems Applications: 11th International Conference, DEXA 2000, pages 685- 697, Lecture Notes in Computer Science 1873, Springer-Verlag, 2000.

[12] J.F. Groote and A. Ponse. The syntax and semantics of µCRL. In: A. Ponse, C. Verhoef and S.F.M. van Vlijmen (editors), Algebra of Communicating Processes ’94, pages 26-62, Workshops in Computing Series, Springer-Verlag, 1995.

[13] S.P. Luttik. On the expressiveness of choice quantification. Ann. Pure Appl. Logic, 121(1):39-87, 2003.

[14] H.J. Tucker. Incremental budgeting: myth or model? Western Political Quarterly, 35(3):327-338, 1982.


  title={Tuplix Calculus},
  author={J.A. Bergstra and A. Ponse and M.B. Van Der Zwaag},
  journal={Scientific Annals of Computer Science},
  organization={``A.I. Cuza'' University, Iasi, Romania},
  publisher={``A.I. Cuza'' University Press}