For best experience please turn on javascript and use a modern browser!
You are using a browser that is no longer supported by Microsoft. Please upgrade your browser. The site may not present itself correctly if you continue browsing.
Bergstra, J. A. (2021). Qualifications of Instruction Sequence Failures, Faults and Defects: Dormant, Effective, Detected, Temporary, and Permanent. Scientific Annals of Computer Science, 31(1), 1-50. https://doi.org/10.7561/SACS.2021.1.1[details]
Bergstra, J. A., & Middelburg, C. A. (2021). Using Hoare Logic in a Process Algebra Setting. Fundamenta Informaticae, 179(4), 321-344. https://doi.org/10.3233/FI-2021-2026[details]
Bergstra, J. A., Ponse, A., & Staudt, D. J. C. (2021). Non-commutative propositional logic with short-circuit evaluation. Journal of Applied Non-Classical Logics, 31(3-4), 234-278. https://doi.org/10.1080/11663081.2021.2010954[details]
Bergstra, J. A. (2020). Most general algebraic specifications for an abstract datatype of rational numbers. Scientific Annals of Computer Science, 30(1), 1-24. https://doi.org/10.7561/SACS.2020.1.1[details]
Bergstra, J. A., & Middelburg, C. A. (2020). On the complexity of the correctness problem for non-zeroness test instruction sequences. Theoretical Computer Science, 802, 1-18. https://doi.org/10.1016/j.tcs.2019.03.040[details]
Bergstra, J. A., & Middelburg, C. A. (2019). Program Algebra for Turing-Machine Programs. Scientific Annals of Computer Science, 29(2), 113-139. https://doi.org/10.7561/SACS.2019.2.113[details]
Bergstra, J. A., & Middelburg, C. A. (2018). A Short Introduction to Program Algebra with Instructions for Boolean Registers. Computer Science Journal of Moldova, 26(3 (78)), 199-232. [details]
Bergstra, J. A., & Middelburg, C. A. (2018). Instruction sequences expressing multiplication algorithms. Scientific Annals of Computer Science, 28(1), 39-66. https://doi.org/10.7561/SACS.2018.1.39[details]
Bergstra, J. A., & Middelburg, C. A. (2017). Axioms for behavioural congruence of single-pass instruction sequences. Scientific Annals of Computer Science, 27(2), 111-135. https://doi.org/10.7561/SACS.2017.2.111[details]
Bergstra, J. A., & Middelburg, C. A. (2017). Contradiction-tolerant process algebra with propositional signals. Fundamenta Informaticae, 153(1-2), 29-55. https://doi.org/10.3233/FI-2017-1530[details]
Bergstra, J. A., & Ponse, A. (2017). Probability Functions in the Context of Signed Involutive Meadows: Extended Abstract. In P. James, & M. Roggenbach (Eds.), Recent Trends in Algebraic Development Techniques: 23rd IFIP WG 1.3 International Workshop, WADT 2016, Gregynog, UK, September 21–24, 2016 : revised selected papers (pp. 73–87). (Lecture Notes in Computer Science; Vol. 10644). Cham: Springer. https://doi.org/10.1007/978-3-319-72044-9_6[details]
2016
Bergstra, J. A., & Middelburg, C. A. (2016). A Hoare-Like Logic of Asserted Single-Pass Instruction Sequences. Scientific Annals of Computer Science, 26(2), 125-156. https://doi.org/10.7561/SACS.2016.2.125[details]
Bergstra, J. A., & Middelburg, C. A. (2016). Instruction sequence size complexity of parity. Fundamenta Informaticae, 149(3), 297-309. https://doi.org/10.3233/FI-2016-1450[details]
Bergstra, J. A., & Middelburg, C. A. (2016). On instruction sets for Boolean registers in program algebra. Scientific Annals of Computer Science, 26(1), 1-26. https://doi.org/10.7561/SACS.2016.1.1[details]
Bergstra, J. A., & Middelburg, C. A. (2016). Transformation of fractions into simple fractions in divisive meadows. Journal of Applied Logic, 16, 92-110. https://doi.org/10.1016/j.jal.2016.03.001[details]
Bergstra, J. A., & Middelburg, C. A. (2015). On algorithmic equivalence of instruction sequences for computing bit string functions. Fundamenta Informaticae, 138(4), 411-434. https://doi.org/10.3233/FI-2015-1219[details]
Bergstra, J. A., & Ponse, A. (2015). Division by zero in common meadows. In R. De Nicola, & R. Hennicker (Eds.), Software, Services, and Systems: essays dedicated to Martin Wirsing on the occasion of his retirement from the Chair of Programming and Software Engineering (pp. 46-61). (Lecture Notes in Computer Science; No. 8950). Cham: Springer. https://doi.org/10.1007/978-3-319-15545-6_6[details]
Bergstra, J. A., Bethke, I., & Ponse, A. (2013). Cancellation meadows: a generic basis theorem and some applications. Computer Journal, 56(1), 3-14. https://doi.org/10.1093/comjnl/bxs028[details]
Bergstra, J., & Middelburg, C. (2013). Timed tuplix calculus and the Wesseling and van den Berg equation. Scientific Annals of Computer Science, 23(2), 169-190. https://doi.org/10.7561/SACS.2013.2.169[details]
Bergstra, J., & Middelburg, C. A. (2013). Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting. Fundamenta Informaticae, 128(4), 367-412. https://doi.org/10.3233/FI-2013-950[details]
Bergstra, J. A., & Bethke, I. (2012). On the contribution of backward jumps to instruction sequence expressiveness. Theory of Computing Systems, 50(4), 706-720. https://doi.org/10.1007/s00224-011-9376-x[details]
Bergstra, J. A., & Middelburg, C. A. (2012). Indirect jumps improve instruction sequence performance. Scientific Annals of Computer Science, 22(2), 253-265. https://doi.org/10.7561/SACS.2012.2.253[details]
Bergstra, J. A., & Middelburg, C. A. (2012). On the behaviours produced by instruction sequences under execution. Fundamenta Informaticae, 120(2), 111-144. https://doi.org/10.3233/FI-2012-753[details]
Bergstra, J. A., & Middelburg, C. A. (2012). On the expressiveness of single-pass instruction sequences. Theory of Computing Systems, 50(2), 313-328. https://doi.org/10.1007/s00224-010-9301-8[details]
Bergstra, J. A., & Ponse, A. (2012). Proposition algebra and short-circuit logic. In F. Arbab, & M. Sirjani (Eds.), Fundamentals of Software Engineering: 4th IPM International Conference, FSEN 2011, Tehran, Iran, April 20-22 2011: revised selected papers (pp. 15-31). (Lecture Notes in Computer Science; Vol. 7141). Heidelberg: Springer. https://doi.org/10.1007/978-3-642-29320-7_2[details]
2011
Bergstra, J. A., & Bethke, I. (2011). Straight-line Instruction Sequence Completeness for Total Calculations on Cancellation Meadows. Theory of Computing Systems, 48(4), 840-864. https://doi.org/10.1007/s00224-010-9272-9[details]
Bergstra, J. A., & Middelburg, C. A. (2011). Preliminaries to an investigation of reduced product set finance. Journal of King Abdulaziz University: Islamic Economics, 24(1), 175-210. https://doi.org/10.4197/Islec.24-1.7[details]
Bergstra, J. A., & Middelburg, C. A. (2010). On the operating unit size of load/store architectures. Mathematical Structures in Computer Science, 20(3), 395-417. https://doi.org/10.1017/S0960129509990314[details]
Bergstra, J. A., & Middelburg, C. A. (2009). Instruction sequences with dynamically instantiated instructions. Fundamenta Informaticae, 96(1-2), 27-48. https://doi.org/10.3233/FI-2009-165[details]
Bergstra, J. A., & Middelburg, C. A. (2009). Transmission protocols for instruction streams. In M. Leucker, & C. Morgan (Eds.), Theoretical Aspects of Computing - ICTAC 2009: 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009 : proceedings (pp. 127-139). (Lecture Notes in Computer Science; Vol. 5684). Berlin: Springer. https://doi.org/10.1007/978-3-642-03466-4_8[details]
Bergstra, J. A., & Ponse, A. (2009). An instruction sequence semigroup with involutive anti-automorphisms. Scientific Annals of Computer Science, 19, 57-92. [details]
Bergstra, J. A., & Klint, P. (2008). The Software Invention Cube: A classification scheme for software inventions. Journal of Intellectual Property Rights, 13(4), 293-300. [details]
Bergstra, J. A., & Middelburg, C. A. (2008). Maurer computers for pipelined instruction processing. Mathematical Structures in Computer Science, 18(02), 373-409. https://doi.org/10.1017/S0960129507006548[details]
Bergstra, J. A., & Middelburg, C. A. (2008). Parallel processes with implicit computational capital. Electronic Notes in Theoretical Computer Science, 209, 55-81. https://doi.org/10.1016/j.entcs.2008.04.004[details]
Bergstra, J., Hirschfeld, Y., & Tucker, J. (2008). Fields, meadows and abstract data types. In A. Avron, N. Dershowitz, & A. Rabinovich (Eds.), Pillars of computer science: Essays dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday (pp. 166-178). (Lecture notes in computer science; No. 4800). Berlin: Springer. https://doi.org/10.1007/978-3-540-78127-1_10[details]
2016
Bergstra, J. A., & Ponse, A. (2016). Datatype defining rewrite systems for the ring of integers, and for natural and integer arithmetic in unary view. (1 ed.) Amsterdam: Informatics Institute, University of Amsterdam. [details]
Bergstra, J. A. (2014). Division by Zero and Abstract Data Types. (Theory of Computer Science electronic report series; No. 1404). Amsterdam: University of Amsterdam, Theory of Computer Science. [details]
Bergstra, J. A. (2014). Four Complete Datatype Defining Rewrite Systems for an Abstract Datatype of Natural Numbers. (3 ed.) (TCS Electronic Report series; No. 1407). Amsterdam: University of Amsterdam, Theory of Computer Science. [details]
Bergstra, J. A. (2014). From Software Crisis to Informational Money. (TCS Electronic Report series; No. 1414). Amsterdam: University of Amsterdam, Theory of Computer Science. [details]
Bergstra, J. A. (2014). Rekenen in een Conservatieve Schrapwet Weide. (TCS Electronic Report series; No. 1405). Amsterdam: University of Amsterdam, Theory of Computer Science. [details]
Bergstra, J. A., & Burgess, M. (2014). Promise Theory: Principles and Applications. CreateSpace. [details]
Bergstra, J. A., & Burgess, M. (2014). Promises, Impositions, and other Directionals. (1 ed.) Amsterdam: Informatics Institute, University of Amsterdam. [details]
Bergstra, J. A., & Ponse, A. (2014). Three Datatype Defining Rewrite Systems for Datatypes of Integers each extending a Datatype of Naturals. (2 ed.) Amsterdam: Informatics Institute, University of Amsterdam. [details]
Bergstra, J. A., & Weijland, P. (2014). Bitcoin: a Money-like Informational Commodity. (1 ed.) Amsterdam: Informatics Institute, University of Amsterdam. [details]
Bergstra, J. A., & Middelburg, C. A. (2012). Instruction Sequences for Computer Science. (Atlantis Studies in Computing; No. 2). Paris: Atlantis Press. [details]
2011
Bergstra, J. A. (2011). Dialectical roots for interest prohibition theory. Ithaca, NY: arXiv.org. [details]
Bergstra, J. A., & Bethke, I. (2009). Straight-line instruction sequence completeness for total calculation on cancellation meadows. Ithaca, NY: arXiv.org. [details]
Bergstra, J. A., & Ponse, A. (2009). A progression ring for interfaces of instruction sequences, threads, and services. Ithaca, NY: arXiv.org. [details]
Bergstra, J. A. (2014). Bitcoin and Islamic Finance. (3 ed.) (TCS Electronic Report series; No. 1406). Amsterdam: University of Amsterdam, Theory of Computer Science. [details]
Bergstra, J. A. (2014). Bitcoin, een "money-like informational commodity". (TCS Electronic Report series; No. 1401). Amsterdam: University of Amsterdam, Theory of Computer Science. [details]
Bergstra, J. A. (2014). Bitcoin: Informational Money en het Einde van Gewoon Geld. (TCS Electronic Report series; No. 1408). Amsterdam: University of Amsterdam, Theory of Computer Science. [details]
Bergstra, J. A. (2014). Bitcoin: not a currency-like informational commodity. (TCS Electronic Report series; No. 1411). Amsterdam: University of Amsterdam, Theory of Computer Science. [details]
Bergstra, J. A., Bethke, I., & Ponse, A. (2014). Rekenen-Informatica. (TCS Electronic Report series; No. 1412). Amsterdam: University of Amsterdam, Theory of Computer Science. [details]
Bergstra, J., Klop, J. W., & Rutten, J. (2013). Obituary for Jaco de Bakker, 1930-2012. Bulletin of the European Association for Theoretical Computer Science, 109, 14-16. [details]
Bergstra, J. A., & Middelburg, C. A. (2011). Interest prohibition and financial product innovation. In A. Escurat (Ed.), Finance islamique: regard(s) sur une finance alternative: recueil d'articles d'experts internationaux (pp. 274-284). Alger: Mazars Hadj Ali.
Bergstra, J. A., & van Vlijmen, S. F. M. (1998). Theoretische software-engineering: kenmerken, faseringen en classificaties. (Quaestiones Infinitae; Vol. 28). Utrecht: Zeno, the Leiden - Utrecht research institute of philosophy. [details]
2017
Bergstra, J. A., Bethke, I., & Hendriks, D. (2017). Universality of Univariate Mixed Fractions in Divisive Meadows. (1 ed.) Amsterdam: Informatics Institute, University of Amsterdam. [details]
Bergstra, J. A. (2016). Adams Conditioning and Likelihood Ratio Transfer Mediated Inference. (3 ed.) Amsterdam: Informatics Institute, University of Amsterdam. [details]
Bergstra, J. A. (2016). Conditional Values in Signed Meadow Based Axiomatic Probability Calculus. (3 ed.) Amsterdam: Informatics Institute, University of Amsterdam. [details]
Bergstra, J. A., & Bethke, I. (2015). A negative result on algebraic specifications of the meadow of rational numbers. (1 ed.) Universiteit van Amsterdam.
Bergstra, J. A., & Bethke, I. (2015). Subvarieties of the variety of meadows. Amsterdam: Informatics Institute, University of Amsterdam. [details]
The UvA website uses cookies and similar technologies to ensure the basic functionality of the site and for statistical and optimisation purposes. It also uses cookies to display content such as YouTube videos and for marketing purposes. This last category consists of tracking cookies: these make it possible for your online behaviour to be tracked. You consent to this by clicking on Accept. Also read our Privacy statement
Necessary
Cookies that are essential for the basic functioning of the website. These cookies are used to enable students and staff to log in to the site, for example.
Necessary & Optimalisation
Cookies that collect information about visitor behaviour anonymously to help make the website work more effectively.
Necessary & Optimalisation & Marketing
Cookies that make it possible to track visitors and show them personalised adverts. These are used by third-party advertisers to gather data about online behaviour. To watch Youtube videos you need to enable this category.