references.bib

@misc{book:javadoc-stack-frame,
  publisher = {Oracle},
  title     = {Java Debug Interface -- StackFrame (JDK 11)},
  url       = {https://docs.oracle.com/en/java/javase/11/docs/api/jdk.jdi/com/sun/jdi/StackFrame.html},
  year      = {2021}
}

@misc{book:javase15-std,
  author    = {Lindholm, Tim and Yellin, Frank and Bracha, Gilad and Buckley, Alex and Smith, Daniel},
  publisher = {Oracle},
  title     = {The Java\textregistered\ Virtual Machine Specification [Heap \& Stack]},
  url       = {https://docs.oracle.com/javase/specs/jvms/se15/html/jvms-2.html#jvms-2.5.2},
  year      = {2020}
}

@article{dive:ackermann,
  author    = {Sundblad, Yngve},
  journal   = {BIT Numerical Mathematics},
  number    = {1},
  pages     = {107--119},
  publisher = {Springer},
  title     = {The Ackermann function. a theoretical, computational, and formula manipulative study},
  url       = {https://link.springer.com/content/pdf/10.1007/BF01935330.pdf},
  volume    = {11},
  year      = {1971}
}

@inproceedings{dive:fibonacci,
  address   = {New York, NY, USA},
  author    = {Rubio-S\'{a}nchez, Manuel and Hern\'{a}n-Losada, Isidoro},
  booktitle = {Proceedings of the 12\textsuperscript{th} Annual SIGCSE Conference on Innovation and Technology in Computer Science Education},
  isbn      = {9781595936103},
  keywords  = {fibonacci numbers, mutual recursion, recursion problems, combinatorics},
  location  = {Dundee, Scotland},
  numpages  = {1},
  pages     = {359},
  publisher = {Association for Computing Machinery},
  series    = {ITiCSE '07},
  title     = {Exploring Recursion with Fibonacci Numbers},
  url       = {https://doi.org/10.1145/1268784.1268931},
  year      = {2007}
}

@misc{dive:java-generics,
  publisher = {Oracle},
  title     = {Lesson: Generics},
  url       = {https://docs.oracle.com/javase/tutorial/java/generics/},
  year      = {2021}
}

@article{dive:recursion,
  author    = {Colson, Lo{\"i}c},
  journal   = {Theoretical Computer Science},
  number    = {1},
  pages     = {57--69},
  publisher = {Elsevier},
  title     = {About primitive recursive algorithms},
  url       = {https://www.sciencedirect.com/science/article/pii/0304397591900395},
  volume    = {83},
  year      = {1991}
}

@article{dive:recursionvsit,
  address    = {New York, NY, USA},
  author     = {Liu, Yanhong A. and Stoller, Scott D.},
  issn       = {0362-1340},
  issue_date = {Nov. 1999},
  journal    = {SIGPLAN Not.},
  month      = nov,
  number     = {11},
  numpages   = {10},
  pages      = {73–82},
  publisher  = {Association for Computing Machinery},
  title      = {From Recursion to Iteration: What Are the Optimizations?},
  url        = {https://doi.org/10.1145/328691.328700},
  volume     = {34},
  year       = {1999}
}

@inproceedings{dive:tail-recursion,
  address   = {New York, NY, USA},
  author    = {Clinger, William D.},
  booktitle = {Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation},
  isbn      = {0897919874},
  location  = {Montreal, Quebec, Canada},
  numpages  = {12},
  pages     = {174--185},
  publisher = {Association for Computing Machinery},
  series    = {PLDI '98},
  title     = {Proper Tail Recursion and Space Efficiency},
  url       = {https://doi.org/10.1145/277650.277719},
  year      = {1998}
}

@misc{gh:tikzpingus,
  author = {Florian Sihler},
  title  = {\LaTeX-Package, tikzpingus},
  url    = {https://github.com/EagleoutIce/tikzpingus},
  year   = {2021}
}