Copyright | (c) Maciej Bendkowski 2017 |
---|---|
License | BSD3 |
Maintainer | maciej.bendkowski@tcs.uj.edu.pl |
Stability | experimental |
Safe Haskell | Safe |
Language | Haskell2010 |
Boltzmann oracles finding numerical approximations of the generating function singularities, dictating the asymptotic growth rate of (closed h-shallow) lambda terms.
The approximations are guaranteed to converge to the singularities quadratically as the Newton-Raphson root finding algorithm is used.
Plain lambda terms
:: (Floating a, Ord a, Integral b) | |
=> Model b | Size notion. |
-> a | Approximation error. |
-> a | Dominating singularity. |
Finds the dominating singularity of the plain lambda term ordinary generating function.
:: (Floating a, Integral b) | |
=> Model b | Size notion. |
-> a | Initial guess. |
-> [a] | Infinite approximation sequence. |
Successive root approximations of the plain lambda terms dominating singularity.