  This book is an introductory course to basic commutative algebra with a
particular emphasis on finitely generated projective modules. We adopt the
constructive point of view, with which all existence theorems have an explicit
algorithmic content content.
  In particular, when a theorem affirms the existence of an object -- the
solution of a problem -- a construction algorithm of the object can always be
extracted from the given proof. We revisit with a new and often simplifying eye
several abstract classical theories. In particular, we review theories which
did not have any algorithmic content in their general natural framework, such
as Galois theory, the Dedekind domains, the finitely generated projective
modules or the Krull dimension.
