Live briefing
Everything about Recursive data type
Data type that refers to itself in its definition
In computer programming, a recursive data type is a data type whose definition contains values of the same type. It is also known as a recursively defined, inductively defined or inductive data type. Data of recursive types are usually viewed as directed graphs. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Recursive data typeA 5-minute orientation
- Skim a recent paper: Solving constrained Horn clauses modulo algebraic data types and recursive functionsInfluential work since 2022
- Pick up a classic book: Fundamentals of Computer Programming with CSharp Free Book (by Nakov & Co.)The most-reprinted book on the subject
- Read the landmark paper: Combining data type and recursive process specifications using projection algebrasCited 19 times
- Go sideways: Algebraic data typeA closely related topic
- Go sideways: Mutual recursionA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Combining data type and recursive process specifications using projection algebras
Nonparametric recursive method for kernel-type function estimators for spatial data
Partially strict non-recursive data types
Pattern minimization problems over recursive data types
Nonparametric Recursive Method for Kernel-Type Function Estimators for Censored Data
Synthesis of recursive-type neural elements with parallel vertical-group data processing
Monotone recursive types and recursive data representations in Cedille
Nonparametric Recursive Kernel Type Eestimators for the Moment Generating Function Under Censored Data
🆕 Influential since 2022
📚 Books worth reading
Fundamentals of Computer Programming with CSharp Free Book (by Nakov & Co.)Svetlin Nakov · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Algebraic data type In computer programming, especially in functional programming and type theory, an algebraic data type (ADT) is a composite data type, i.e. a type formed…
- Mutual recursion In mathematics and computer science, mutual recursion is a form of recursion where two or more mathematical or computational objects, such as functions…
- Corecursion In computer science, corecursion is a type of operation that is dual to (structural) recursion. Whereas recursion consumes a data structure by first handling…
- Catamorphism In functional programming, the concept of catamorphism (from the Ancient Greek: κατά "downwards" and μορφή "form, shape") denotes the unique homomorphism…
- Mogensen–Scott encoding In computer science, Scott encoding is a way to represent algebraic data types in the lambda calculus, following their syntactic definition without regard…
- Initial algebra In mathematics, an initial algebra is an initial object in the category of F-algebras for a given endofunctor F. This initiality provides a general framework…
- Recursion (computer science) In computer science, recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same…
- Fold (higher-order function) In functional programming, a fold is a higher-order function that analyzes a recursive data structure and, through use of a given combining operation,…