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.

Dr. I. (Inge) Bethke

Faculty of Science
Informatics Institute
Photographer: I. Bethke

Visiting address
  • Science Park 904
  • Room number: C2.112
Postal address
  • Postbus 94323
    1090 GH Amsterdam
Contact details
  • Profiel
  • Publications

    2017

    2015

    2013

    2012

    2011

    2010

    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

    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). The Netherlands: 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

    2000

    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

    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., ... Zaytsev, V. (2014). Whitepaper: Project-based curricula. Amsterdam: Universiteit van Amsterdam. [details]

    2010

    • Bergstra, J. A., & Bethke, I. (2010). On the contribution of backward jumps to instruction sequence expressiveness. Ithaca, NY: arXiv.org. [details]

    2009

    • Bergstra, J. A., & Bethke, I. (2009). Square root meadows. 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]
    • Rodenburg, P. H., & Bethke, I. (2009). Typability in partial groupoids. Ithaca, NY: arXiv.org. [details]

    2008

    • Bethke, I., & Rodenburg, P. (2008). The initial meadows. Ithaca, NY: arXiv.org. [details]

    2007

    • Bergstra, J. A., Bethke, I., & Burgess, M. (2007). A Process Algebra Based Framework for Promise Theory. (PRG technical report). Ithaca, NY: arXiv.org. [details]
    • Bethke, I., & Rodenburg, P. H. (2007). Some properties of finite meadows. Ithaca, NY: arXiv.org. [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). Amsterdam: University of Amsterdam, Theory of Computer Science. [details]

    2003

    • Bethke, I., & Ponse, A. (2003). Programma-Algebra, een inleiding tot de Programmatuur. Amsterdam: Vossiuspers UvA. [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]

    2015

    • 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]

    2014

    • Bergstra, J. A., & Bethke, I. (2014). Note on paraconsistency and reasoning about fractions. Ithaca, NY: arXiv.org. [details]
    • Bergstra, J. A., Bethke, I., & Ponse, A. (2014). Equations for formally real meadows. Ithaca, NY: arXiv.org. [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