PublisherThe University of Arizona.
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.
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.
Degree ProgramHonors College