AERN-RnToRm-0.3.0.3: AERN-RnToRm.cabal

Name:           AERN-RnToRm
Version:        0.3.0.3
Cabal-Version:  >= 1.2
Build-Type:     Simple
License:        BSD3
License-File:   LICENCE
Author:         Michal Konecny (Aston University)
Copyright:      (c) 2007-2008 Michal Konecny
Maintainer:     mik@konecny.aow.cz
Stability:      experimental
Category:       Data, Math
Synopsis:       polynomial function enclosures (PFEs) approximating exact real functions
Tested-with:    GHC ==6.8.2
Description:
    AERN-RnToRm provides
    datatypes and abstractions for approximating functions
    of type @D -> R^m@ where @D@ is a bounded interval in @R^n@
    with non-empty interior.
    .
    The main datatype are function enclosures whose boundaries are
    piece-wise polynomial with a bounded degree.  (This degree can
    be set arbitrarily high or as low as 0.)
    This datatype is supported by safely rounding operations
    whose precision can be increased arbitrarily, so that they
    all converge to the exact operations.
    Field operations, integration, maximisation and some elementary operations 
    (namely exp, sin, cos) are among those already implemented.
    .
    For an architectural overview, see module "Data.Number.ER.RnToRm".
    .
    A mathematical description of the very basics as well as a brief comparison
    with Taylor Models is included in the
    paper <http://www-users.aston.ac.uk/~konecnym/papers/cfv08.html>.
    .
    Simple examples of usage can be found in module @Demo.hs@ in folder @tests@.
Extra-source-files:
    ChangeLog tests/Demo.hs

Flag containers-in-base
    Default: False

Library
  hs-source-dirs:  src
  if flag(containers-in-base)
    Build-Depends:
      base < 3, binary >= 0.4, AERN-Real >= 0.9.6
  else
    Build-Depends:
      base >= 3, containers, binary >= 0.4, AERN-Real >= 0.9.6
  Exposed-modules:
    Data.Number.ER.RnToRm,
    Data.Number.ER.RnToRm.BisectionTree.Path,
    Data.Number.ER.RnToRm.BisectionTree.Integration,
    Data.Number.ER.RnToRm.BisectionTree,
    Data.Number.ER.RnToRm.DefaultRepr,
    Data.Number.ER.RnToRm.UnitDom.ChebyshevBase.Polynom.Basic,
    Data.Number.ER.RnToRm.UnitDom.ChebyshevBase.Polynom.Elementary,
    Data.Number.ER.RnToRm.UnitDom.ChebyshevBase.Polynom.Field,
    Data.Number.ER.RnToRm.UnitDom.ChebyshevBase.Polynom.Integration,
    Data.Number.ER.RnToRm.UnitDom.ChebyshevBase.Polynom.Eval,
    Data.Number.ER.RnToRm.UnitDom.ChebyshevBase.Polynom.Bounds,
    Data.Number.ER.RnToRm.UnitDom.ChebyshevBase.Polynom,
    Data.Number.ER.RnToRm.UnitDom.Base,
    Data.Number.ER.RnToRm.UnitDom.Approx.Interval,
    Data.Number.ER.RnToRm.UnitDom.Approx,
    Data.Number.ER.RnToRm.Approx.DomTransl,
    Data.Number.ER.RnToRm.Approx.PieceWise,
    Data.Number.ER.RnToRm.Approx.DomEdges,
    Data.Number.ER.RnToRm.Approx.Tuple,
    Data.Number.ER.RnToRm.Approx,
    Data.Number.ER.RnToRm.TestingDefs  
    
  Extensions: 
    CPP,
    DeriveDataTypeable,
    FlexibleContexts,
    FlexibleInstances,
    FunctionalDependencies,
    MultiParamTypeClasses,
    UndecidableInstances