Dynamic construction of aglebraic closure and a coinductive proof of Hensel's lemma

Abstract

In this thesis we present a dynamic construction of the algebraic closure of a zero characteristic field implemented in the functional programming language Haskell based on Duval’s dynamic evaluation method. We also present a complete formalization of the ring of formal power series. Based on that we present a coinductive proof Hensel’s lemma. As an application we present an implementation of Newton algorithm for factorization of polynomials with power series coefficients.