On list primitive recursion and the complexity of computing inf

DOI10.1007/BF01995103zbMath0787.68047MaRDI QIDQ688724

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) Semantics in the theory of computing (68Q55) Data structures (68P05)

Related Items (3)

Inferring Static Non-monotone Size-aware Types Through Testing ⋮ A unary representation result for system \(T\) ⋮ System \(T\), call-by-value and the minimum problem

Cites Work

• Automatic synthesis of typed \(\Lambda\)-programs on term algebras
• Unnamed Item
• Unnamed Item

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