Areas of Expertise

  • computability
  • domain theory
  • domain representations
  • computable real numbers
  • exact computations
  • exact real arithmetic
  • continuous data types


  1. & Canonical effective subalgebras of classical algebras as constructive metric completions. Journal of Universal Computer Science 16(18), 2496-2522.
  2. & Stability for Effective Algebras. Electronic Notes in Theoretical Computer Science 221, 3
  3. Reducibility of domain representations and Cantor–Weihrauch domain representations. Mathematical Structures in Computer Science 18(06), 1031-1056.
  4. Efficient exact computation of iterated maps. The Journal of Logic and Algebraic Programming 64(1), 41
  5. & Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. Theoretical Computer Science 284(2), 207

See more...


  • CS-170 Modelling Computing Systems 1

    This module introduces students to mathematical tools and techniques for modelling computing systems.

  • CS-210 Concurrency

    This module provides an introduction to the issues raised in developing and using concurrent and distributed systems. Consideration of practical and formal solutions to example problems from operating systems and networking.