Foundations of Computing
We work on a wide range of topics that can broadly be summarized by logic in computer science, and foundations of software science, computer systems and programming languages.
Events and Activities
Seminar on Computational Social Science (ongoing).
- Samuel Balco - Proof Theory of Multi-Type Display Calculi
- James Hoey - Reversible debugging of multi-threaded programs
- Mirzhan Irkegulov - Game Theory
- John Whitington - Program Analysis
- Yi Xiao - Nominal Automata
- Hao Zeng - Nominal Automata
We work in a number of areas including: Calculi and models of concurrent, distributed, mobile, and context-aware computing; (Co)algebraic and categorical models; Modal logic and description logic; Proof theory and tableaux systems; General systems theory and computational models (chemical, biological, etc); Semantics of conceptual modelling methods and techniques; Semantics of programming languages; Type theory; Lambda-calculus; nfinitary lambda calculus; Rewriting; Session types; Graph transformations; Term rewriting; Theorem proving; Stochastic approaches; Rewriting of bio-structures; Nominal techniques; Verification;
Contact details for each staff member and most PhD students are available from their respective homepages.