About primitive recursive algorithms

DOI10.1016/0304-3975(91)90039-5zbMath0744.03042OpenAlexW1966181449MaRDI QIDQ1176246

Loïc Colson

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90039-5

zbMATH Keywords

denotational semanticsrewriting systemfunctional programmingcall-by-nameprimitive recursive function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Recursive functions and relations, subrecursive hierarchies (03D20) General topics in the theory of software (68N01)

Related Items (12)

Iterating on multiple collections in synchrony ⋮ Decidability results for primitive recursive algorithms ⋮ On primitive recursive algorithms and the greatest common divisor function ⋮ A complete characterization of primitive recursive intensional behaviours ⋮ Execution trace sets for real computation ⋮ Unnamed Item ⋮ Computing minimum with primitive recursion over lists ⋮ Intensional aspects of function definitions ⋮ On the proof-theoretic foundation of general definition theory ⋮ 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

• On a hitherto unexploited extension of the finitary standpoint
• LCF considered as a programming language
• Constructive mathematics and computer programming
• The Expressiveness of Simple and Second-Order Type Structures
• Intensional interpretations of functionals of finite type I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: About primitive recursive algorithms