On list primitive recursion and the complexity of computing inf

DOI10.1007/BF01995103zbMATH Open0787.68047MaRDI QIDQ688724FDOQ688724

Authors: Loïc Colson 

Publication date: 28 November 1993

Published in: BIT (Search for Journal in Brave)

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

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)

Cites Work

• Title not available (Why is that?)
• Automatic synthesis of typed \(\Lambda\)-programs on term algebras
• Title not available (Why is that?)

Cited In (7)

• About primitive recursive algorithms
• A unary representation result for system \(T\)
• Decidability results for primitive recursive algorithms
• The efficiency of primitive recursive functions: a programmer's view
• Title not available (Why is that?)
• System \(T\), call-by-value and the minimum problem
• Inferring static non-monotone size-aware types through testing

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)