If you made any changes in Pure these will be visible here soon.

Personal profile

Research Interests

Higher-order computability, semantics of programming languages, realizability models.


1991-1995PhD in Computer Science, University of Edinburgh
 Thesis title: Realizability toposes and language semantics
1989-1990Certificate of Advanced Study in Mathematics ('Part III'), distinction, University of Cambridge
1986-1989BA (Hons) in Mathematics, first class, University of Cambridge


John Longley studied Mathematics at the University of Cambridge, and worked for a year in Formal Methods at Plessey Research and Technology before embarking on a PhD in the Laboratory for Foundations of Computer Science, University of Edinburgh. His work lies at the intersection of mathematical logic and theoretical computer science, focusing in particular on concepts of computability in higher-order settings. Together with Dag Normann of Oslo University, he has co-authored a book, 'Higher-Order Computability', which is due to be published by Springer in 2015.


Dive into the research topics where John Longley is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
  • 1 Similar Profiles

Collaborations and top research areas from the last five years

Recent external collaboration on country/territory level. Dive into details by clicking on the dots or