We may earn an affiliate commission when you visit our partners.

Recursive Functions

Save
Coming soon We're preparing course recommendations and better information about Recursive Functions. Check back soon for more details.

Path to Recursive Functions

Take the first step.
We've curated one courses to help you on your path to Recursive Functions. Use these to develop your skills, build background knowledge, and put what you learn to practice.
Sorted from most relevant to least relevant:

Share

Help others find this page about Recursive Functions: by sharing it with your friends and followers:

Reading list

We've selected 11 books that we think will supplement your learning. Use these to develop background knowledge, enrich your coursework, and gain a deeper understanding of the topics covered in Recursive Functions.
This classic work by Stephen Kleene groundbreaking treatise on recursion theory and its applications to the foundations of mathematics. It must-read for researchers in mathematical logic and computer science.
Provides a comprehensive overview of recursion theory, exploring its history, foundations, and applications in computer science and mathematics.
This advanced textbook delves deeply into the mathematical foundations of recursion, exploring topics such as computability theory, Gödel's incompleteness theorems, and Kolmogorov complexity. It is suitable for advanced students and researchers in mathematics, computer science, and related fields.
Presents a foundational treatment of recursive programming, exploring its theoretical underpinnings and practical applications in software development.
This classic textbook presents a rigorous and comprehensive treatment of recursion, covering both theoretical foundations and practical applications. It valuable resource for advanced students and researchers in computer science.
Provides a thorough exploration of recursive techniques in programming, covering their use in functional programming, data structures, and algorithms.
Investigates recursion schemes, a powerful technique for programming recursive functions, and analyzes their computational complexity and programmability.
This introductory textbook provides a comprehensive overview of recursion, covering both theoretical foundations and practical applications. It is well-suited for students and professionals who are new to the topic.
Focuses on teaching the basics of recursion in Python, providing detailed explanations and interactive exercises.
This specialized book explores the use of recursion in the design and analysis of data structures and algorithms. It covers advanced topics such as recursive trees, heaps, and dynamic programming.
This specialized book explores the use of recursion in functional programming languages, providing a detailed treatment of topics such as tail recursion, lazy evaluation, and recursion schemes. It is particularly relevant for computer scientists and programmers interested in functional programming.
Our mission

OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.

Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.

Find this site helpful? Tell a friend about us.

Affiliate disclosure

We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.

Your purchases help us maintain our catalog and keep our servers humming without ads.

Thank you for supporting OpenCourser.

© 2016 - 2025 OpenCourser