PyQt-4.7 for FreeBSD. The official update notes can be found at
http://www.riverbankcomputing.com
We'd like to say thanks to all helpers, testers and submitters.
- Remove USE_GCC since the creators of GiNaC claim that it now works with gcc-3.4
PR: ports/143314
Submitted by: Stephen Montgomery-Smith <stephen@missouri.edu> (maintainer)
and affine spaces in Haskell. It also defines a type of infinite towers
of generalized derivatives. A generalized derivative is a linear
transformation rather than one of the common concrete representations
(scalars, vectors, matrices, etc).
WWW: http://haskell.org/haskellwiki/vector-space
PR: ports/142492
Submitted by: Jacula Modyun <jacula(at)gmail.com>
useful in statistics. Our focus is on high performance, numerical
robustness, and use of good algorithms. Where possible, we provide
references to the statistical literature.
WWW: http://darcs.serpentine.com/statistics
PR: ports/142294
Submitted by: Jacula Modyun <jacula(at)gmail.com>
numbers that follow either a uniform or normal distribution. The
generated numbers are suitable for use in statistical applications.
The uniform PRNG uses Marsaglia's MWC256 (also known as MWC8222)
multiply-with-carry generator, which has a period of 2^8222 and
fares well in tests of randomness. It is also extremely fast,
between 2 and 3 times faster than the Mersenne Twister.
WWW: http://darcs.serpentine.com/mwc-random
PR: ports/142293
Submitted by: Jacula Modyun <jacula(at)gmail.com>
in terms of their distributions by using a monad.
The monad is similar to the List monad for non-deterministic computations,
but extends the List monad by a measure of probability.
Small interface to R plotting.
WWW: http://haskell.org/haskellwiki/Probabilistic_Functional_Programming
PR: ports/142292
Submitted by: Jacula Modyun <jacula(at)gmail.com>
compiling Agda programs. The program can also generate hyperlinked,
highlighted HTML files from Agda sources.
WWW: http://wiki.portal.chalmers.se/agda/
PR: ports/142141
Submitted by: Jacula Modyun <jacula(at)gmail.com>
families, which are similar to Haskell's GADTs, but they can be indexed by
values and not just types. It also has parameterised modules, mixfix operators,
Unicode characters, and an interactive Emacs interface (the type checker can
assist in the development of your code).
Agda is also a proof assistant: It is an interactive system for writing and
checking proofs. Agda is based on intuitionistic type theory, a foundational
system for constructive mathematics developed by the Swedish logician Per
Martin-Lof. It has many similarities with other proof assistants based on
dependent types, such as Coq, Epigram and NuPRL.
WWW: http://wiki.portal.chalmers.se/agda/
PR: ports/142141
Submitted by: Jacula Modyun <jacula(at)gmail.com>
ideas from category theory. Notable bits include: comonads,
adjunctions, and various recursion schemes a'la the research paper
"Functional Programming with Bananas, Lenses, Envelopes and
Barbed Wire".
WWW: http://comonad.com/reader/
PR: ports/142142
Submitted by: Jacula Modyun <jacula(at)gmail.com>
