Search results
Results: 52
Number of items: 52
-
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
-
Bergstra, J. A., Bethke, I., & Ponse, A. (2013). Equations for formally real meadows. ArXiv. https://arxiv.org/abs/1310.5011v1 -
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 -
Bethke, I., Ponse, A., & Rodenburg, P. H. (2011). Preface: This issue is dedicated to Jan Bergstra on the occasion of his sixtieth birthday. Theoretical Computer Science, 412(28), 3033-3034. https://doi.org/10.1016/j.tcs.2011.04.016
-
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 -
Bethke, I., & Rodenburg, P. (2011). Typability in partial applicative structures. Journal of Logic, Language and Information, 20(2), 161-168. https://doi.org/10.1007/s10849-010-9124-7 -
Bergstra, J. A., & Bethke, I. (2010). On the contribution of backward jumps to instruction sequence expressiveness. ArXiv. http://arxiv.org/abs/1005.5662 -
Bethke, I., & Rodenburg, P. (2010). The initial meadows. Journal of Symbolic Logic, 75(3), 888-895. https://doi.org/10.2178/jsl/1278682205 -
Rodenburg, P. H., & Bethke, I. (2009). Typability in partial groupoids. ArXiv. http://arxiv.org/abs/0901.0188
Page 2 of 6