Infinite data structures are theoretical constructs used in computer science and mathematics to represent data sequences or collections that have no fixed size or end. They are often used in functional programming and theoretical computer science to model streams or lazy evaluations, allowing computations over potentially unbounded data sets without requiring all data to be stored in memory at once.