John Longley

According to our database, John Longley authored at least 16 papers between 1997 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

Effects for efficiency: asymptotic speedup with first-class control.

Daniel Hillerström, Sam Lindley, John Longley

Proc. ACM Program. Lang., 2020

2019

Bar recursion is not computable via iteration.

John Longley

Comput., 2019

2018

The recursion hierarchy for PCF is strict.

John Longley

Log. Methods Comput. Sci., 2018

The encodability hierarchy for PCF types.

John Longley

CoRR, 2018

2015

Higher-Order Computability

John Longley, Dag Normann

Theory and Applications of Computability, Springer, ISBN: 978-3-662-47992-6, 2015

2014

Computability structures, simulations and realizability.

John Longley

Math. Struct. Comput. Sci., 2014

2009

Some Programming Languages Suggested by Game Models (Extended Abstract).

John Longley

Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

2008

Interpreting Localized Computational Effects Using Operators of Higher Type.

John Longley

Proceedings of the Logic and Theory of Algorithms, 2008

2007

On the ubiquity of certain total type structures.

John Longley

Math. Struct. Comput. Sci., 2007

2004

Reasoning About CBV Functional Programs in Isabelle/HOL.

John Longley, Randy Pollack

Proceedings of the Theorem Proving in Higher Order Logics, 17th International Conference, 2004

2002

On the Ubiquity of Certain Total Type Structures: (Extended Abstract).

John Longley

Proceedings of the Workshop on Domains VI 2002, Birmingham, UK, September 16-19, 2002, 2002

The sequentially realizable functionals.

John Longley

Ann. Pure Appl. Log., 2002

2000

Constructive Data Refinement in Typed Lambda Calculus.

Furio Honsell, John Longley, Donald Sannella, Andrzej Tarlecki

Proceedings of the Foundations of Software Science and Computation Structures, 2000

1999

When is a Functional Program Not a Functional Program?

John Longley

Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), 1999

1998

Matching typed and untyped realizability.

John Longley

Proceedings of the Workshop on Domains IV 1998, 1998

1997

Partial Functions in a Total Setting.

Simon Finn, Michael P. Fourman, John Longley

J. Autom. Reason., 1997