Dr. I. (Inge) Bethke
Faculty of Science
Informatics Institute
Visiting address
- Science Park 900
Postal address
-
Postbus 94323
1090 GH Amsterdam
Contact details
- Profiel
-
Publications
2017
Bergstra, J. A., & Bethke, I. (2017). Subvarieties of the Variety of Meadows. Scientific Annals of Computer Science, 27(1), 1-18. https://doi.org/10.7561/SACS.2017.1.1 [details]
2015
- Bergstra, J. A., & Bethke, I. (2015). Note on paraconsistency and reasoning about fractions. Journal of Applied Non-Classical Logics, 25(2), 120-124. https://doi.org/10.1080/11663081.2015.1047232 [details]
- Bergstra, J. A., Bethke, I., & Ponse, A. (2015). Equations for formally real meadows. Journal of Applied Logic, 13(2, pt. B), 1-23. Advance online publication. https://doi.org/10.1016/j.jal.2015.01.004 [details]
- Bethke, I., Rodenburg, P., & Sevenster, A. (2015). The structure of finite meadows. Journal of Logical and Algebraic Methods in Programming, 84(2), 276-282. Advance online publication. https://doi.org/10.1016/j.jlamp.2014.08.004 [details]
2013
- Bergstra, J. A., Bethke, I., & Ponse, A. (2013). Cancellation meadows: a generic basis theorem and some applications. Computer Journal, 56(1), 3-14. Advance online publication. https://doi.org/10.1093/comjnl/bxs028 [details]
2012
- 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]
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]
- 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 [details]
2010
- Bethke, I., & Rodenburg, P. (2010). The initial meadows. Journal of Symbolic Logic, 75(3), 888-895. https://doi.org/10.2178/jsl/1278682205 [details]
2007
- Bergstra, J. A., & Bethke, I. (2007). Predictable and Reliable Program Code: Virtual Machine-Based Projection Semantics. In J. A. Bergstra, & M. Burgess (Eds.), Handbook of Network and System Administration (pp. 653-658). Elsevier. [details]
- Bergstra, J. A., Bethke, I., & Ponse, A. (2007). Decision problems for pushdown threads. Acta Informatica, 44, 75-90. https://doi.org/10.1007/s00236-007-0040-5 [details]
- Bergstra, J. A., Bethke, I., & Ponse, A. (2007). Thread algebra and risk assessment services. In C. Dimitracopoulos, L. Newelski, & D. Normann (Eds.), Proceedings Logic Colloquium 2005 (Vol. 28, pp. 1-17). Cambridge University Press. [details]
2005
- Bergstra, J. A., & Bethke, I. (2005). An upper bound for the equational specification of finite state services. Information Processing Letters, 94(6), 267-269. https://doi.org/10.1016/j.ipl.2005.02.010 [details]
- Bergstra, J. A., & Bethke, I. (2005). Network algebra in Java. The Journal of Logic and Algebraic Programming, 62(2), 247-271. https://doi.org/10.1016/j.jlap.2004.03.011 [details]
- Bergstra, J. A., & Bethke, I. (2005). Polarized process algebra with reactive composition. Theoretical Computer Science, 343, 285-304. https://doi.org/10.1016/j.tcs.2005.06.014 [details]
2003
- Bergstra, J. A., & Bethke, I. (2003). Polarized Process Algebra and Program Equivalence. In J. C. M. Baeten, J. K. Lenstra, J. Parrow, & G. J. Woeginger (Eds.), Automata, Languages and Programming, 30th International Colloquium, ICALP 2003 (Vol. 2719, pp. 1-21). Springer. [details]
- Bethke, I. (2003). Completion of equational specifications. In Terese (Ed.), Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science (pp. 260-300). (55). Cambridge: Cambridge University Press. [details]
- Bethke, I. (2003). Lambda calculus. In Terese (Ed.), Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science (pp. 548-587). (45). Cambridge: Cambridge University Press. [details]
2002
- Bergstra, J. A., & Bethke, I. (2002). Molecular dynamics. The Journal of Logic and Algebraic Programming, 51(2), 193-214. https://doi.org/10.1016/S1567-8326(02)00021-8 [details]
2000
- Bethke, I., Klop, J. W., & Vrijer, R. D. (2000). Descendants and origins in term rewriting. Information and Computation, 159(1-2), 59-124. https://doi.org/10.1006/inco.2000.2876 [details]
1999
- Bethke, I., Klop, J. W., & Vrijer, R. D. (1999). Extending partial combinatory algebras. Mathematical Structures in Computer Science, 9(4), 483-506.
1996
- Bethke, I., & Klop, J. W. (1996). Collapsing partial combinatory algebras. Lecture Notes in Computer Science, 1074, 57-73.
- Bethke, I., & Rodenburg, P. H. (1996). Equational constructor induction. Fundamenta Informaticae, 25(1), 1-16.
- Bethke, I., Klop, J. W., & Vrijer, R. D. (1996). Completing partial combinatory algebras with unique head-normal forms. In Proc. 11th Annual IEEE Symposium on Logic and Computer Science, New Brunswick, New Jersey, 27-30 July 1996 (pp. 448-454). IEEE Computer Society Press.
1995
- Bergstra, J. A., Bethke, I., & Rodenburg, P. H. (1995). A propositional logic with four values: true, false, divergent and meaningless. Journal of Applied Non-Classical Logics, 5, 199-217. [details]
1994
- Bergstra, J. A., Bethke, I., & Ponse, A. (1994). Process algebra with combinators. Lecture Notes in Computer Science, 832, 36-65.
- Bergstra, J. A., Bethke, I., & Ponse, A. (1994). Process algebra with iteration and nesting. Computer Journal, 37(4), 243-258. https://doi.org/10.1093/comjnl/37.4.243 [details]
1991
- Bethke, I. (1991). Coherence Spaces are Untopological. Theoretical Computer Science, 85(2), 353-357. https://doi.org/10.1016/0304-3975(91)90187-7
- Bethke, I. (1991). Finite Type Structures within Combinatory Algebras. Annals of Pure and Applied Logic, 55(2), 101-123. https://doi.org/10.1016/0168-0072(91)90004-6
1987
- Bethke, I. (1987). On the existence of extensional partial combinatory algebras. Journal of Symbolic Logic, 52(3), 819-833. https://doi.org/10.2307/2274368
2014
- van Albada, D., Bakker, R., Bethke, I., Belleman, R., van den Berg, D., Bruntink, M., Dekkers, H., Douma, R., van Inge, T., Lagerberg, J., Pimentel, A., Polstra, S., Poss, R., Varbanescu, A. L., Visser, A., & Zaytsev, V. (2014). Whitepaper: Project-based curricula. Universiteit van Amsterdam. [details]
2010
- Bergstra, J. A., & Bethke, I. (2010). On the contribution of backward jumps to instruction sequence expressiveness. ArXiv. http://arxiv.org/abs/1005.5662 [details]
2009
- Bergstra, J. A., & Bethke, I. (2009). Square root meadows. ArXiv. http://arxiv.org/abs/0901.4664 [details]
- Bergstra, J. A., & Bethke, I. (2009). Straight-line instruction sequence completeness for total calculation on cancellation meadows. ArXiv. http://arxiv.org/abs/0905.4612 [details]
- Rodenburg, P. H., & Bethke, I. (2009). Typability in partial groupoids. ArXiv. http://arxiv.org/abs/0901.0188 [details]
2008
- Bethke, I., & Rodenburg, P. (2008). The initial meadows. ArXiv. http://arxiv.org/abs/0806.2256v1 [details]
2007
- Bergstra, J. A., Bethke, I., & Burgess, M. (2007). A Process Algebra Based Framework for Promise Theory. (PRG technical report). ArXiv. http://arxiv.org/abs/0707.0744 [details]
- Bethke, I., & Rodenburg, P. H. (2007). Some properties of finite meadows. ArXiv. http://arxiv.org/abs/0712.0917 [details]
2006
- Bergstra, J. A., & Bethke, I. (2006). Predictable and Reliable Program Code: Virtual Machine-based Projection Semantics. Amsterdam: Programming Research Group, UvA. [details]
2005
- Bergstra, J. A., Bethke, I., & Ponse, A. (2005). Decision Problems for Pushdown Threads. (PRG0502). Amsterdam: Informatics Institute. [details]
2000
- Bergstra, J. A., & Bethke, I. (2000). Network algebra in Java. (J.A. Bergstra, Objects, classes, molecules and threads). Amsterdam: Informatics Institute. [details]
- Bergstra, J. A., & Bethke, I. (2000). Network algebra in Java. In J. A. Bergstra (Ed.), Objects, classes, molecules and threads Amsterdam: Faculteit der Natuurwetenschappen Wiskunde en InformaticaUVA. [details]
- Bergstra, J. A., Bethke, I., & Loots, M. E. (2000). A First Course on C Program Reading. (Report P0002). Amsterdam: Informatics Institute. [details]
- Bergstra, J. A., Bethke, I., & Ponse, A. (2000). Basic Multi-Competence Programming. (Report P0001). Amsterdam: Informatics Institute. [details]
- Bergstra, J. A., Bethke, I., & Ponse, A. (2000). Data flow networks in Java. In J. A. Bergstra (Ed.), Objects, classes, molecules and threads Amsterdam: Faculteit der Natuurwetenschappen, Wiskunde en Informatica. [details]
- Bethke, I., & Kaldeway, A. (2000). Datastructuren en Java. Amsterdam: Informatics Institute. [details]
1997
- Bethke, I., Klop, J. W., & Vrijer, R. D. (1997). Origin tracking in orthogonal term rewriting systems. (IR-441). Amsterdam: Vrije Universiteit Amsterdam, Department of Mathematics and Computer Science.
1993
- Bethke, I., & Ponse, A. (1993). A car registration authority, a concise PSF specification. (P9318). Amsterdam: University of Amsterdam, Informatics Institute.
1989
- Bethke, I., & Richards, B. (1989). Temporal databases: An IQ approach. In Temporal Representation and Inference (pp. 231-284). (Cognitive Science Series). Academic Press.
- Bethke, I., & Richards, B. (1989). The temporal logic IQ. In Temporal Representation and Inference (pp. 211-230). (Cognitive Science Series). Academic Press.
2014
- 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 [details]
2003
- Bethke, I., & Ponse, A. (2003). Programma-Algebra, een inleiding tot de Programmatuur. Amsterdam: Vossiuspers UvA. [details]
2005
- Bethke, I., Diertens, B., & Ponse, A. (2005). Webklas Informatica: Wat is een programma? Electronic publication in Dutch. http://www.science.uva.nl/~alban/WebKlas
1997
- Bethke, I., Klop, J. W., & Vrijer, R. D. (1997). Looking back. In Liber amicorum, Paul Klint 25 jaar SMC/CWI (pp. 43-55). Amsterdam: CWI.
2017
- Bergstra, J. A., Bethke, I., & Hendriks, D. (2017). Universality of Univariate Mixed Fractions in Divisive Meadows. (1 ed.) Informatics Institute, University of Amsterdam. https://arxiv.org/abs/1707.00499 [details]
2015
- Bergstra, J. A., & Bethke, I. (2015). A negative result on algebraic specifications of the meadow of rational numbers. (1 ed.) Universiteit van Amsterdam. https://arxiv.org/abs/1507.00548v1
- Bergstra, J. A., & Bethke, I. (2015). Subvarieties of the variety of meadows. Informatics Institute, University of Amsterdam. https://arxiv.org/abs/1510.04021v3 [details]
2014
- Bergstra, J. A., & Bethke, I. (2014). Note on paraconsistency and reasoning about fractions. ArXiv. https://arxiv.org/abs/1410.8692v1 [details]
- Bergstra, J. A., Bethke, I., & Ponse, A. (2014). Equations for formally real meadows. ArXiv. https://arxiv.org/abs/1310.5011v2 [details]
This list of publications is extracted from the UvA-Current Research Information System. Questions? Ask the library or the Pure staff of your faculty / institute. Log in to Pure to edit your publications. Log in to Personal Page Publication Selection tool to manage the visibility of your publications on this list. -
Ancillary activities
No ancillary activities
Bergstra, J. A., & Bethke, I. (2017). Subvarieties of the Variety of Meadows. Scientific Annals of Computer Science, 27(1), 1-18.