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

Visa enkel post
dc.contributor.authorMannaa, Bassel
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik, Datavetenskap (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering, Computing Science (Chalmers)en
dc.date.accessioned2019-07-03T12:22:53Z
dc.date.available2019-07-03T12:22:53Z
dc.date.issued2010
dc.description.abstractIn 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.
dc.identifier.urihttps://hdl.handle.net/20.500.12380/125001
dc.language.isoeng
dc.setspec.uppsokTechnology
dc.subjectDatavetenskap (datalogi)
dc.subjectBeräkningsmatematik
dc.subjectComputer Science
dc.subjectComputational Mathematics
dc.titleDynamic construction of aglebraic closure and a coinductive proof of Hensel's lemma
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
dc.type.uppsokH
local.programmeComputer science – algorithms, languages and logic (MPALG), MSc
Ladda ner
Original bundle
Visar 1 - 1 av 1
Bild (thumbnail)
Namn:
125001.pdf
Storlek:
913.4 KB
Format:
Adobe Portable Document Format
Beskrivning:
Fulltext
Ladda ner
Samling
Examensarbeten för masterexamen