21 citations · 27 across the 4 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2013★ 2 cited
A Swiss Pocket Knife for Computability
Neil D. Jones
This research is about operational- and complexity-oriented aspects of classical foundations of computability theory. The approach is to re-examine some classical theorems and cons…
cs.PL2008★ 21 cited
Call-by-value Termination in the Untyped lambda-calculus
Neil D. Jones, Nina Bohr
A fully-automated algorithm is developed able to show that evaluation of a given untyped lambda-expression will terminate under CBV (call-by-value). The ``size-change principle'' f…