Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimizing the stack size of recursive functions

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

DOI10.1016/j.cl.2008.04.003zbMath1387.68066OpenAlexW1980491019MaRDI QIDQ1749239

Stefan Schaeckeler, Weijia Shang

Publication date: 16 May 2018

Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cl.2008.04.003


zbMATH Keywords

recursionprogram transformationmemory compactionrecursion removalpost pass optimizationprogram size optimizationstack size reduction


Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Systematic derivation of incremental programs
  • A Transformation System for Developing Recursive Programs


This page was built for publication: Optimizing the stack size of recursive functions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1749239&oldid=14087904"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 06:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki