This online help node and the nodes below it describe the Magma machinery provided for computing with abstract abelian groups. Such a group may be described either in terms of defining relations (category GrpAb) or by defining the group operations on some finite set (category GrpAbGen). In the case of finitely presented groups, the abelian groups may be finite and infinite, the only restriction being that the group be finitely generated.