Persistent Link:
http://hdl.handle.net/10150/579284
Title:
Group Theoretical Algorithms in Haskell
Author:
Gautreau, Matthew Arthur
Issue Date:
2015
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
This will be an exploration of the implementation of classic computational group theory algorithms using the programming language Haskell. Haskell is unlike the languages typically used in computational algebra, though it has an emphasis on algebraic types. In implementing these algorithms in Haskell, we will assess its utility and costs for this use case. It is expected that the type system of Haskell will be able to provide guarantees that are not possible in other languages, though there likely will be a cost associated with the properties that give Haskell its strong type system.
Type:
text; Electronic Thesis
Degree Name:
B.S.
Degree Level:
bachelors
Degree Program:
Honors College; Mathematics
Degree Grantor:
University of Arizona
Advisor:
Lux, Klaus

Full metadata record

DC FieldValue Language
dc.language.isoen_USen
dc.titleGroup Theoretical Algorithms in Haskellen_US
dc.creatorGautreau, Matthew Arthuren
dc.contributor.authorGautreau, Matthew Arthuren
dc.date.issued2015en
dc.publisherThe University of Arizona.en
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en
dc.description.abstractThis will be an exploration of the implementation of classic computational group theory algorithms using the programming language Haskell. Haskell is unlike the languages typically used in computational algebra, though it has an emphasis on algebraic types. In implementing these algorithms in Haskell, we will assess its utility and costs for this use case. It is expected that the type system of Haskell will be able to provide guarantees that are not possible in other languages, though there likely will be a cost associated with the properties that give Haskell its strong type system.en
dc.typetexten
dc.typeElectronic Thesisen
thesis.degree.nameB.S.en
thesis.degree.levelbachelorsen
thesis.degree.disciplineHonors Collegeen
thesis.degree.disciplineMathematicsen
thesis.degree.grantorUniversity of Arizonaen
dc.contributor.advisorLux, Klausen
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.