2000ACM SIGPLAN NoticesOpen access

Lazy lists in C++

Sibylle Schupp

Open full text 2 citations

Abstract

Languages that support lazy evaluation allow computations with "infinite" data structures (lazy lists); C++ is not among these languages. Using an idiom of generic programming in C++, template metaprogramming, this paper shows how to provide lazy lists nevertheless.

Open-access reader

About this research paper

What this paper is about

Languages that support lazy evaluation allow computations with "infinite" data structures (lazy lists); C++ is not among these languages. Using an idiom of generic programming in C++, template metaprogramming, this paper shows how to provide lazy lists nevertheless.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Languages that support lazy evaluation allow computations with "infinite" data structures (lazy lists); C++ is not among these languages. Using an idiom of generic programming in C++, template metaprogramming, this paper shows how to provide lazy lists nevertheless.

Key concepts: Computer science, Metaprogramming, Lazy evaluation, Programming language, Generic programming, Functional programming

Related papers

Back to paper searchBrowse research topicsOriginal source
Lazy lists in C++ — Research Paper | ScholarLens