contact

mw. dr. I. Bethke


  • Faculteit der Natuurwetenschappen, Wiskunde en Informatica
    IVI
  • POSTBUS  94323
    1090 GH  Amsterdam
    Kamernummer: C2.110
  • I.Bethke@uva.nl
    T:  0205257583

2013

2012

2011

2010

2007

  • J.A. Bergstra & I. Bethke (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.
  • J.A. Bergstra, I. Bethke & A. Ponse (2007). Decision problems for pushdown threads. Acta Informatica, 44, 75-90.
  • J.A. Bergstra, I. Bethke & A. Ponse (2007). Thread algebra and risk assessment services. In Costas Dimitracopoulos, Ludomir Newelski & Dag Normann (Eds.), Proceedings Logic Colloquium 2005 (pp. 1-17). Cambridge University Press.

2005

  • J.A. Bergstra & I. Bethke (2005). An upper bound for the equational specification of finite state services. Information Processing Letters, 94 (6), 267-269.
  • J.A. Bergstra & I. Bethke (2005). Polarized process algebra with reactive composition. Theoretical Computer Science, 343, 285-304.
  • J.A. Bergstra & I. Bethke (2005). Network algebra in Java. The Journal of Logic and Algebraic Programming, 62 (2), 247-271.

2003

  • I. Bethke (2003). Completion of equational specifications. In Terese (Ed.), Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science (55) (pp. 260-300). Cambridge: Cambridge University Press.
  • I. Bethke (2003). Lambda calculus. In Terese (Ed.), Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science (45) (pp. 548-587). Cambridge: Cambridge University Press.
  • J.A. Bergstra & I. Bethke (2003). Polarized Process Algebra and Program Equivalence. In Jos.C.M. Baeten, Jan.Karel Lenstra, Joachim Parrow & Gerhard.J. Woeginger (Eds.), Automata, Languages and Programming, 30th International Colloquium, ICALP 2003 (pp. 1-21). The Netherlands: Springer.

2002

  • J.A. Bergstra & I. Bethke (2002). Molecular dynamics. The Journal of Logic and Algebraic Programming, 51 (2), 193-214.

2000

  • I. Bethke, J.W. Klop & R. de Vrijer (2000). Descendants and origins in term rewriting. Information and Computation, 159 (1-2), 59-124.

1999

  • I. Bethke, J.W. Klop & R. de Vrijer (1999). Extending partial combinatory algebras. Mathematical Structures in Computer Science, 9 (4), 483-506.

1996

  • I. Bethke & P.H. Rodenburg (1996). Equational constructor induction. Fundamenta Informaticae, 25 (1), 1-16.
  • I. Bethke, J.W. Klop & R. de Vrijer (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.
  • I. Bethke & J.W. Klop (1996). Collapsing partial combinatory algebras. In K.M.G. Dowek, J. Heering & B. Moller (Eds.), Higher-Order Algebra, Logic, and Term Rewriting (HOA ’95) Vol. 1074. Lecture Notes in Computer Science (pp. 57-73). Springer-Verlag.

1995

  • J.A. Bergstra, I. Bethke & P.H. Rodenburg (1995). A propositional logic with four values: true, false, divergent and meaningless. Journal of Applied Non-Classical Logics, 5, 199-217.

1994

  • J.A. Bergstra, I. Bethke & A. Ponse (1994). Process algebra with combinators. In K. Meinke, E. Borger & Y. Gurevich (Eds.), Computer Science Logic Vol. 832. Lecture Notes in Computer Science (pp. 36-65). Berlijn: Springer-Verlag.
  • J.A. Bergstra, I. Bethke & A. Ponse (1994). Process algebra with iteration and nesting. Computer Journal, 37 (4), 243-258.

1991

  • I. Bethke (1991). Coherence Spaces are Untopological. Theoretical Computer Science, 85 (2), 353-357.
  • I. Bethke (1991). Finite Type Structures within Combinatory Algebras. Annals of Pure and Applied Logic, 55 (2), 101-123.

1987

  • I. Bethke (1987). On the existence of extensional partial combinatory algebras. Journal of Symbolic Logic, 52 (3), 819-833.

2014

  • D. van Albada, R. Bakker, I. Bethke, R. Belleman, D. van den Berg, M. Bruntink, H. Dekkers, R. Douma, T. van Inge, J. Lagerberg, A. Pimentel, S. Polstra, R. Poss, A.L. Varbanescu, A. Visser & V. Zaytsev (2014). Whitepaper: Project-based curricula. (extern rapport). Amsterdam: Universiteit van Amsterdam.

2013

2010

2009

2008

2007

2006

  • J.A. Bergstra & I. Bethke (2006). Predictable and Reliable Program Code: Virtual Machine-based Projection Semantics. (extern rapport, no PRG0603). Amsterdam: Programming Research Group, UvA.

2005

  • J.A. Bergstra, I. Bethke & A. Ponse (2005). Decision Problems for Pushdown Threads. (intern rapport, PRG0502). Amsterdam: Informatics Institute.

2000

  • J.A. Bergstra, I. Bethke & A. Ponse (2000). Data flow networks in Java. In J.A. Bergstra (Ed.), Objects, classes, molecules and threads. Amsterdam: Faculteit der Natuurwetenschappen, Wiskunde en Informatica.
  • I. Bethke & A. Kaldeway (2000). Datastructuren en Java. (intern rapport). Amsterdam: Informatics Institute.
  • J.A. Bergstra & I. Bethke (2000). Network algebra in Java. (intern rapport, J.A. Bergstra, Objects, classes, molecules and threads). Amsterdam: Informatics Institute.
  • J.A. Bergstra, I. Bethke & M.E. Loots (2000). A First Course on C Program Reading. (intern rapport, Report P0002). Amsterdam: Informatics Institute.
  • J.A. Bergstra & I. Bethke (2000). Network algebra in Java. In J.A. Bergstra (Ed.), Objects, classes, molecules and threads. Amsterdam: Faculteit der Natuurwetenschappen Wiskunde en InformaticaUVA.
  • J.A. Bergstra, I. Bethke & A. Ponse (2000). Basic Multi-Competence Programming. (intern rapport, Report P0001). Amsterdam: Informatics Institute.

1997

  • I. Bethke, J.W. Klop & R. de Vrijer (1997). Origin tracking in orthogonal term rewriting systems. (extern rapport, IR-441). Amsterdam: Vrije Universiteit Amsterdam, Department of Mathematics and Computer Science.

1993

  • I. Bethke & A. Ponse (1993). A car registration authority, a concise PSF specification. (intern rapport, P9318). Amsterdam: University of Amsterdam, Informatics Institute.

1989

  • I. Bethke & B. Richards (1989). The temporal logic IQ. In Temporal Representation and Inference (Cognitive Science Series) (pp. 211-230). Academic Press.
  • I. Bethke & B. Richards (1989). Temporal databases: An IQ approach. In Temporal Representation and Inference (Cognitive Science Series) (pp. 231-284). Academic Press.

2014

  • J.A. Bergstra, I. Bethke & A. Ponse (2014). Rekenen-Informatica. (intern rapport, TCS, Electronic Reports). Amsterdam: Universiteit van Amsterdam.

2003

  • I. Bethke & A. Ponse (2003). Programma-Algebra, een inleiding tot de Programmatuur. Amsterdam: Vossiuspers UvA.
This page has been automatically generated by the UvA-Current Research Information System. If you have any questions about the content of this page, please contact the UBAcoach or the Metis staff of your faculty / institute. To edit your publications login to Personal Metis.
  • Geen nevenwerkzaamheden

bewerk