Article Dans Une Revue Mathematical Structures in Computer Science Année : 2020

Primitive recursion in the abstract

Résumé

Recurrence can be used as a function definition schema for any non-trivial free algebra, yielding the same computational complexity in all cases. We show that primitive-recursive computing is in fact independent of free algebras altogether, and can be characterized by a generic programming principle, namely the control of iteration by the depletion of finite components of the underlying structure.

Fichier principal
Vignette du fichier
mscs.pdf (186.11 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-02573188 , version 1 (14-05-2020)

Licence

Identifiants

Citer

Daniel Leivant, Jean-Yves Marion. Primitive recursion in the abstract. Mathematical Structures in Computer Science, 2020, 30 (1), pp.33-43. ⟨10.1017/S0960129519000112⟩. ⟨hal-02573188⟩
139 Consultations
493 Téléchargements

Altmetric

Partager

  • More