Search results
Results: 368
Number of items: 368
-
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). Springer. https://doi.org/10.1007/978-3-319-15545-6_6 -
Bergstra, J. A., & Burgess, M. (2014). Promise Theory: Principles and Applications. CreateSpace. https://www.createspace.com/4653947
-
Bergstra, J. A., & Middelburg, C. A. (2014). Instruction sequence size complexity of parity. ArXiv. https://arxiv.org/abs/1412.6787v1
-
Bergstra, J. A., & Middelburg, C. A. (2014). A Thread Algebra with Probabilistic Features. Informatics Institute, University of Amsterdam. http://arxiv.org/abs/1409.6873
-
Bergstra, J. A., & Bethke, I. (2014). Note on Paraconsistency and the Logic of Fractions. (1 ed.) Informatics Institute, University of Amsterdam. http://arxiv.org/abs/1410.8692v1
-
Bergstra, J. A., & Middelburg, C. A. (2014). A Hoare-like logic of asserted single-pass instruction sequences. ArXiv. http://arxiv.org/abs/1408.2955v1
-
Bergstra, J. A., & Ponse, A. (2014). Three Datatype Defining Rewrite Systems for Datatypes of Integers each extending a Datatype of Naturals. (2 ed.) Informatics Institute, University of Amsterdam. http://arxiv.org/abs/1406.3280v2
-
Bergstra, J. A., & Middelburg, C. A. (2014). On algorithmic equivalence of instruction sequences for computing bit string functions. ArXiv. http://arxiv.org/abs/1402.4950v2
-
Bergstra, J. A., Bethke, I., & Ponse, A. (2014). Rekenen-Informatica. (TCS Electronic Report series; No. 1412). University of Amsterdam, Theory of Computer Science. https://ivi.fnwi.uva.nl/tcs/pub/tcsreports/TCS1412.pdf
-
Bergstra, J. A., & Ponse, A. (2014). Division by zero in common meadows. ArXiv. http://arxiv.org/abs/1406.6878v1
Page 7 of 37