Computing minimum with primitive recursion over lists

DOI10.1016/0304-3975(95)00243-XzbMath0874.68146MaRDI QIDQ671369

Daniel Fredholm

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

call-by-value evaluation orderlists of natural numbersprimitive recursive algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (6)

Decidability results for primitive recursive algorithms ⋮ A complete characterization of primitive recursive intensional behaviours ⋮ Unnamed Item ⋮ On the asymptotic behaviour of primitive recursive algorithms ⋮ System \(T\), call-by-value and the minimum problem ⋮ The efficiency of primitive recursive functions: a programmer's view

Cites Work

• Intensional aspects of function definitions
• About primitive recursive algorithms
• Unnamed Item

This page was built for publication: Computing minimum with primitive recursion over lists