GiNaC is an iterated and recursive acronym for GiNaC is Not a CAS,
where CAS stands for Computer Algebra System. It is designed to allow
the creation of integrated systems that embed symbolic manipulations
together with more established areas of computer science (like
computation-intense numeric applications, graphical interfaces, etc.)
under one roof.
GRPN is a RPN calculator for the X Window system built using
the GIMP Toolkit (GTK).
GRPN works with real numbers, complex numbers, matrices, and
complex matrices. Numbers can be displayed in 4 different
radix modes, and complex numbers can be displayed in either
Cartesian or polar form.
PDL (``Perl Data Language'') gives standard perl the ability to
COMPACTLY store and SPEEDILY manipulate the large N-dimensional data
arrays which are the bread and butter of scientific computing.
The idea is to turn perl in to a free, array-oriented, numerical
language in the same sense as commerical packages like IDL and
MatLab. One can write simple perl expressions to manipulate entire
numerical arrays all at once. For example, using PDL the perl variable
$a can hold a 1024x1024 floating point image, it only takes 4Mb of
memory to store it and expressions like $a=sqrt($a)+2 would manipulate
the whole image in a few seconds.
A simple interactive shell (perldl) is provided for command line use
together with a module (PDL) for use in perl scripts.
A tool that "multiply imputes" missing data in a single cross-section
(such as a survey), from a time series (like variables collected for
each year in a country), or from a time-series-cross-sectional data set
(such as collected by years for each of several countries).
Agda is a dependently typed functional programming language: It has inductive
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.
Instances of numeric classes for functions and tuples.
Adjunctions and representable functors.