Recursive data types are data structures that contain values of the same type. They are used to define dynamic data structures such as Lists and Trees, which can grow in size at runtime. The term "inductive data type" is sometimes used for non-recursive algebraic data types.
Carnegie Mellon University
Spring 2014
A comprehensive course at Carnegie Mellon University that introduces fundamental principles of programming language design and implementation from a mathematical perspective. It delves deep into the structural and dynamic aspects of programming languages, studying concepts like recursion, objects, polymorphism, and parallelism.
No concepts data
+ 38 more concepts