Dr Simon Gay

  • Senior Lecturer (Computing Science)

telephone: 01413306035
email: Simon.Gay@glasgow.ac.uk

Research interests

Personal site: http://www.dcs.gla.ac.uk/~simon

Biography:
Dr Simon Gay joined the School of Computing Science as a Lecturer in 2000, and became a Senior Lecturer in 2006. Before coming to the University of Glasgow he was a Lecturer in Computer Science at Royal Holloway, University of London, and before that, a Research Associate in the Department of Computing at Imperial College London. He has an MA in Pure and Applied Mathematics and a Diploma in Computer Science, both from the University of Cambridge, and a PhD in Computing from Imperial College London.

Dr Gay's research concerns two main areas. The first is foundations of programming languages, especially the topic of type systems for concurrent and distributed programming languages. The second is quantum computing, especially the development of formal verification techniques for systems that combine quantum and classical computation and communication.

Within the School of Computing Science, Dr Gay is a member of the Formal Analysis, Theory and Algorithms (FATA) research group. He is also actively involved in the Scottish Programming Languages Seminar (SPLS) and Quantum Information Scotland (QuISco), and is a member of the Research Committee of the British Computer Society Academy of Computing.

Research Interests:
- Foundations of programming languages
- type systems
- quantum information
- formal verification

Selected publications

Gay, S., and Vasconcelos, V. (2010) Linear type theory for asynchronous session types. Journal of Functional Programming, 20 (01). pp. 19-50. (doi:10.1017/S0956796809990268)

Gay, S., Vasconcelos, V., Ravara, A., Gesbert, N., and Caldeira, A. (2010) Modular session types for distributed object-oriented programming. In: 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 17-23 Jan 2010, Madrid, Spain.

Donaldson, A.F., and Gay, S.J. (2010) Type inference and strong static type checking for Promela. Science of Computer Programming, 75 (11). pp. 1165-1191. (doi:10.1016/j.scico.2010.05.010)

Gay, S. (2008) Bounded polymorphism in session types. Mathematical Structures in Computer Science, 18 (05). pp. 895-930. (doi:10.1017/S0960129508006944)