Item Details

title

A Functional Computer Algebra System for Polynomials

author

Meek, Thomas

abstract

The polynomial-algorithms package is a computer algebra system written in Haskell. This package implements a polynomial type as well as several algorithms which use that type. These include a recursive version of Buchberger's algorithm for finding the reduced Groebner basis of a polynomial ideal. As it is written in Haskell, the polynomial-algorithms package naturally uses a purely functional design philosophy. We will contrast this implementation with imperative approaches using more traditional languages.

subject

Buchberger's algorithm

computer algebra system

functional programming

Haskell

polynomials

contributor

Moore, Frank (advisor)

Kirkman, Ellen (committee member)

Turkett, William (committee member)

date

2023-07-25T17:48:35Z (accessioned)

2023-07-25T17:48:35Z (available)

2023 (issued)

degree

Mathematics (discipline)

identifier

http://hdl.handle.net/10339/102243 (uri)

language

en (iso)

publisher

Wake Forest University

type

Thesis