Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A programming technique for recursive procedures

From MaRDI portal
Publication:4092971
Jump to:navigation, search

DOI10.1007/BF01931364zbMATH Open0327.68036OpenAlexW2040469806MaRDI QIDQ4092971FDOQ4092971


Authors: B. J. Cornelius, G. H. Kirby Edit this on Wikidata


Publication date: 1976

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01931364





Mathematics Subject Classification ID

General topics in the theory of software (68N01)


Cites Work

  • Depth of recursion and the ackermann function
  • Title not available (Why is that?)
  • The Ackermann function. a theoretical, computational, and formula manipulative study
  • Title not available (Why is that?)


Cited In (1)

  • Recursive converters on a memory

Uses Software

  • ALGOL 68





This page was built for publication: A programming technique for recursive procedures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4092971)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4092971&oldid=17854206"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 06:32. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki