Abstract
A combination of program algebra with the theory of meadows is designed leading to a theory of computation in algebraic structures. It is proven that total functions on cancellation meadows can be computed by straight-line programs using at most five auxiliary variables. A similar result is obtained for signed meadows.
Article PDF
Similar content being viewed by others
References
Bergstra, J.A., Bethke, I.: Polarized process algebra and program equivalence. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30–July 4. LNCS, vol. 2719, pp. 1–21. Springer, Berlin (2003)
Bergstra, J.A., Bethke, I., Ponse, A.: Decision problems for pushdown threads. Acta Inform. 44(2), 75–90 (2007)
Bergstra, J.A., Hirschfeld, Y., Tucker, J.V.: Meadows and the equational specification of division. Theor. Comput. Sci. 410(12–13), 1261–1271 (2009)
Bergstra, J.A., Loots, M.E.: Program algebra for sequential code. J. Logic Algebr. Program. 51(2), 125–156 (2002)
Bergstra, J.A., Middelburg, C.A.: Thread algebra for strategic interleaving. Form. Asp. Comput. 19(4), 445–474 (2007)
Bergstra, J.A., Middelburg, C.A.: Instruction sequence processing operators (2009). arXiv:0909.2088
Bergstra, J.A., Ponse, A.: Combining programs and state machines. J. Logic Algebr. Program. 51, 175–192 (2002)
Bergstra, J.A., Ponse, A.: A generic basis theorem for cancellation meadows (2008). arXiv:0803.3969v2
Bergstra, J.A., Ponse, A., van der Zwaag, M.B.: Tuplix calculus. Sci. Ann. Comput. Sci. 18, 35–61 (2008)
Bergstra, J.A., Tucker, J.V.: The rational numbers as an abstract data type. J. ACM 54(2) (2007)
Bethke, I., Rodenburg, P.: The initial meadows. J. Symb. Log., September, 2010
Bethke, I., Rodenburg, P., Sevenster, A.: The structure of finite meadows (2009). arXiv:0903.1196
Bui, D.B., Mavlyanov, A.V.: Theory of program algebras. Ukr. Math. J. 36(6), 761–764 (1984)
Bui, D.B., Mavlyanov, A.V.: Mutual derivability of operations in program algebra. I. Cybern. Syst. Anal. 24(1), 35–39 (1988)
Bui, D.B., Mavlyanov, A.V.: Mutual derivability of operations in program algebra. II. Cybern. Syst. Anal. 24(6), 1–6 (1988)
Ibarra, O.A., Moran, S.: Probabilistic algorithms for deciding equivalence of straight-line programs. J. Assoc. Comput. Mach. 30(1), 217–228 (1983)
Ibarra, O.A., Leininger, B.S.: On the simplification and equivalence problems for straight-line programs. J. Assoc. Comput. Mach. 30(3), 641–656 (1983)
Ponse, A., van der Zwaag, M.B.: An introduction to program and thread algebra. In: Beckmann, A., et al. (eds.) Logical Approaches to Computational Barriers: Proceedings CiE 2006. LNCS, vol. 3988, pp. 445–458. Springer, Berlin (2006)
von Wright, J.: An interactive metatool for exploring program algebras. Turku Centre for Computer Science, TUCS Technical Report No. 247, March, 1999
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Bergstra, J.A., Bethke, I. Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows. Theory Comput Syst 48, 840–864 (2011). https://doi.org/10.1007/s00224-010-9272-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-010-9272-9