31 citations · 92 across the 14 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
cs.LO2006★ 4 cited
Adventures in time and space
Norman Danner, James S. Royer
This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its first-ord…
cs.LO2006
The weak pigeonhole principle for function classes in S^1_2
Norman Danner, Chris Pollett
It is well known that S^1_2 cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability o…