Showing cs.LOShow all
2 papers · 1 filter
cs.LO2007
Two algorithms in search of a type system
Norman Danner, James S. Royer
The authors' ATR programming formalism is a version of call-by-value PCF under a complexity-theoretically motivated type system. ATR programs run in type-2 polynomial-time and all…
cs.LO2007
Time-complexity semantics for feasible affine recursions (extended abstract)
Norman Danner, James S. Royer
The authors' ATR programming formalism is a version of call-by-value PCF under a complexity-theoretically motivated type system. ATR programs run in type-2 polynomial-time and all…