3 citations · 5 across the 3 of their papers we have counts for
4 papers
Effects for Efficiency: Asymptotic Speedup with First-Class Control
Daniel Hillerström, Sam Lindley, John Longley
We study the fundamental efficiency of delimited control. Specifically, we show that effect handlers enable an asymptotic improvement in runtime complexity for a certain class of f…
The encodability hierarchy for PCF types
John Longley
Working with the simple types over a base type of natural numbers (including product types), we consider the question of when a type is encodable as a definable retract of :…
Bar recursion is not computable via iteration
John Longley
We show that the bar recursion operators of Spector and Kohlenbach, considered as third-order functionals acting on total arguments, are not computable in Goedel's System T plus mi…
The recursion hierarchy for PCF is strict
John Longley
We consider the sublanguages of Plotkin's PCF obtained by imposing some bound k on the levels of types for which fixed point operators are admitted. We show that these languages fo…