Research output per year
Research output per year
Personal profile
Research Interests
Higher-order computability, semantics of programming languages, realizability models.
Qualifications
| 1991-1995 | PhD in Computer Science, University of Edinburgh |
| Thesis title: Realizability toposes and language semantics | |
| 1989-1990 | Certificate of Advanced Study in Mathematics ('Part III'), distinction, University of Cambridge |
| 1986-1989 | BA (Hons) in Mathematics, first class, University of Cambridge |
Biography
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.
Fingerprint
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
Network
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Effects for Efficiency: Asymptotic Speedup with First-Class Control
Hillerström, D., Lindley, S. & Longley, J., 2 Aug 2020, In: Proceedings of the ACM on Programming Languages. 4, ICFP, p. 1-29 29 p., 100.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Bar recursion is not computable via iteration
Longley, J., 25 Jan 2019, (E-pub ahead of print) In: Computability. p. 1-44 44 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
The recursion hierarchy for PCF is strict
Longley, J., 21 Aug 2018, In: Logical Methods in Computer Science. 14, 3, p. 1-51 51 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Higher-Order Computability
Longley, J. & Normann, D., 7 Nov 2015, Springer-Verlag Berlin Heidelberg. 571 p. (Theory and Applications of Computability)Research output: Book/Report › Book
-
The recursion hierarchy for PCF is strict
Longley, J., Jul 2015, 48 p. (Informatics Research Report; no. EDI-INF-RR-1421).Research output: Working paper
Open AccessFile
Projects
- 1 Finished