JC
2006
14 years 13 days ago
2006
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...
101
click to vote
POPL
2006
ACM
15 years 24 days ago
2006
ACM
Abstract. 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...