John Longley

John Longley is a part-time Lecturer in the School of Informatics at the University of Edinburgh, affiliated with the Laboratory for Foundations of Computer Science. His research is centered on higher-order computability, mathematical logic, and game semantics in programming languages.

Research Interests: His work explores the foundations of computation, especially what it means for operations of higher types to be computable. He investigates various models including Kleene computability, λ-algebras, and intensional models. His research bridges mathematical logic and theoretical computer science, with applications in programming language semantics and constructive mathematics.

John Longley's publications, including the comprehensive book Higher-Order Computability (2015), reflect a deep engagement with computability at higher types. His recent works continue to explore foundational models, sequentiality, continuity, and realizability, forming a cohesive body of work in theoretical computer science. He has also developed educational tools like Stratagem and Eriskay to teach game semantics interactively.

Scientific Awards:

• No specific awards mentioned in the provided texts.

Advising and Grants: While no explicit list of students or grants is provided, his role as a lecturer and active researcher suggests involvement in student supervision and research funding. He has co-authored significant works and maintains a research group presence via his laboratory affiliation.

Labs and Teams: He is a member of the Laboratory for Foundations of Computer Science (LFCS), a leading research group in theoretical computer science at the University of Edinburgh, contributing to foundational research in logic, semantics, and computability.