homepage: ''
changelog-type: markdown
hash: a066fca42dae02e77acdd165c9368b97205f14691f7794a6dac5e79016eca436
test-bench-deps:
  test-framework: -any
  base: ! '>=4.11 && <6'
  test-framework-quickcheck2: -any
  QuickCheck: -any
maintainer: Ross Paterson <R.Paterson@city.ac.uk>
synopsis: finite or repeating lists
changelog: |
  # 1.0.0.0

  * Initial release
basic-deps:
  base: ! '>=4.11 && <6'
  containers: -any
all-versions:
- 1.0.0.0
author: Ross Paterson
latest: 1.0.0.0
description-type: haddock
description: |-
  A rational list is a list that is either finite or of the form
  @xs ++ cycle ys@ where @xs@ and @ys@ are finite lists and @ys@
  is non-empty.  Such lists have a finite representation, supporting
  list operations that terminate even for infinite lists, and are
  often more efficient.
license-name: BSD-3-Clause

Update from Hackage at 2019-10-20T21:18:27Z
Update from Hackage at 2019-10-20T21:18:27Z
