exact-real-positional: Framework for Exact Real Arithmetic in the Positional Number System

[ bsd3, library, math ] [ Propose Tags ]

Computable real numbers are represented in a signed digit floating point representation. Each number consists of an infinitly sequence of these digits. Basic arithmetic operators are implemented, conversion from and into other Haskell number types is possible.


[Skip to Readme]

Modules

[Index]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.0.0
Change log ChangeLog.md
Dependencies base (>=4.9 && <4.10) [details]
License BSD-3-Clause
Author grlks
Maintainer lukas9@mi.fu-berlin.de
Category Math
Uploaded by grlks at 2017-07-20T21:28:34Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 877 total (5 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2017-07-20 [all 1 reports]

Readme for exact-real-positional-0.0.0

[back to package description]

exact-real-positional

Framework for Exact Real Arithmetic in the Positional Number System (Base 2, digits -1, 0, 1)

Most implementations of exact real arithmetic are using continued fractions to represent computable reals. Exact real arithmetic with a positional number system was the original concept in Alan Turing's "On Computable Numbers". The positional number system has some more or less obvious advantages over continued fractions. This software was developed during my bachelor thesis and should not be useful in this early stage, except for demo purposes.