homepage: http://andersk.mit.edu/haskell/constructible/
changelog-type: ''
hash: 0795284c06b54dd8f7594a4263f594ae4088525fbc4122ff5db72cf40480b0c0
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.*
  arithmoi: ! '>=0.1'
all-versions:
- '0.1'
- 0.1.0.1
author: Anders Kaseorg <andersk@mit.edu>
latest: 0.1.0.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: 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

Update from Hackage at 2020-02-09T13:49:24Z
Update from Hackage at 2020-02-09T13:49:24Z
