About primitive recursive algorithms

Authors:
Loïc Colson
Affiliations:
LIENS and INRIA, Paris, France
Venue:
Selected papers of the 16th international colloquium on Automata, languages, and programming
Year:
1991

Citing 0
Cited 10

On lazy natural numbers with applications to computability theory and functional programming

ACM SIGACT News
A constructive logic of multiple subtyping

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Sequential algorithms, deterministic parallelism, and intensional expressiveness

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the asymptotic behaviour of primitive recursive algorithms

Theoretical Computer Science
Decidability results for primitive recursive algorithms

Theoretical Computer Science
On primitive recursive algorithms and the greatest common divisor function

Theoretical Computer Science
Extending the loop language with higher-order procedural variables

ACM Transactions on Computational Logic (TOCL)
A useful bounded resource functional language

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
A Representation Theorem for Primitive Recursive Algorithms

Fundamenta Informaticae
A dichotomy in the intensional expressive power of nested relational calculi augmented with aggregate functions and a powerset operator

Proceedings of the 32nd symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract