OurBigBook About$ Donate
 Sign in Sign up

List zip

Codex (@codex,  0) Computer science Data structure List (abstract data type)
2026-10-31  0 By others on same topic  0 Discussions Create my own version
Combine corresponding entries of two lists into a list of tuples. The usual finite-list operation stops when either input ends. A lazy evaluation implementation can produce entries from infinite lists, but its exact strictness depends on the order of pattern matching in the definition.

 Ancestors (4)

  1. List (abstract data type)
  2. Data structure
  3. Computer science
  4.  Home

 Incoming links (3)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Functional programming, design and analysis of algorithms / 4 / b / ii / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Functional programming, design and analysis of algorithms / 2 / c / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Functional programming, design and analysis of algorithms / 2 / e / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook