Edinburgh Research Explorer

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.

Research outputs

  1. The recursion hierarchy for PCF is strict

    Research output: Working paper

  2. Higher-Order Computability

    Research output: Book/ReportBook

  3. Computability structures, simulations and realizability

    Research output: Contribution to journalArticle

View all (15) »

ID: 11220