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

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]

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]


Versions 0.0.0, 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:27:16Z




Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Readme for exact-real-positional-0.0.0

[back to package description]


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.