homepage: http://andersk.mit.edu/haskell/constructible/
changelog-type: ''
hash: 8deb5610cc26c648194edba30ce734a9097b5eb43a1ea27b157cb2273968ef8a
test-bench-deps: {}
maintainer: Anders Kaseorg <andersk@mit.edu>
synopsis: Exact computation with constructible real numbers
changelog: ''
basic-deps:
  binary-search: ! '>=0.0'
  complex-generic: ! '>=0.1'
  base: ==4.*
  integer-roots: ! '>=1.0'
all-versions:
- '0.1'
- 0.1.0.1
- 0.1.1
author: Anders Kaseorg <andersk@mit.edu>
latest: 0.1.1
description-type: haddock
description: |-
  The constructible reals are the subset of the real numbers that can
  be represented exactly using field operations (addition,
  subtraction, multiplication, division) and positive square roots.
  They support exact computations, equality comparisons, and ordering.
license-name: BSD-3-Clause

homepage: http://andersk.mit.edu/haskell/constructible/
changelog-type: ''
hash: 08a3de0fcdaeba619fc50fecd74c1e20d97f7a02cb0a7936d23f835935d1e719
test-bench-deps: {}
maintainer: Anders Kaseorg <andersk@mit.edu>
synopsis: Exact computation with constructible real numbers
changelog: ''
basic-deps:
  binary-search: '>=0.0'
  complex-generic: '>=0.1'
  base: ==4.*
  integer-roots: '>=1.0'
all-versions:
- '0.1'
- 0.1.0.1
- 0.1.1
- 0.1.2
author: Anders Kaseorg <andersk@mit.edu>
latest: 0.1.2
description-type: haddock
description: |-
  The constructible reals are the subset of the real numbers that can
  be represented exactly using field operations (addition,
  subtraction, multiplication, division) and positive square roots.
  They support exact computations, equality comparisons, and ordering.
license-name: BSD-3-Clause

Update from Hackage at 2021-11-09T19:02:40Z
Update from Hackage at 2021-11-09T19:02:40Z
