On list primitive recursion and the complexity of computing inf

DOI10.1007/BF01995103MaRDI QIDQ688724zbMATH OpenFDO

Authors Loïc Colson

Publication date 28 November 1993

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

primitive recursive programrecursion on lists

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Semantics in the theory of computing (68Q55)

Recommendations

• Computing minimum with primitive recursion over lists
• scientific article; zbMATH DE number 559098
• Logic Programs for Primitive Recursive Sets
• About primitive recursive algorithms
• scientific article; zbMATH DE number 1342252

Cites work

• scientific article; zbMATH DE number 3960962 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Automatic synthesis of typed \(\Lambda\)-programs on term algebras

Cited in

(7)

• The efficiency of primitive recursive functions: a programmer's view
• Inferring static non-monotone size-aware types through testing
• System \(T\), call-by-value and the minimum problem
• A unary representation result for system \(T\)
• Decidability results for primitive recursive algorithms
• scientific article; zbMATH DE number 5199066 (Why is no real title available?)
• About primitive recursive algorithms

This page was built for publication: On list primitive recursion and the complexity of computing inf

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688724)