Digital.Maag Repository

Limitations of SML in computational category theory

Show simple item record

dc.contributor.author Matola, Tod H.
dc.contributor.other Youngstown State University. Department of Mathematics.
dc.date.accessioned 2021-04-26T16:03:15Z
dc.date.available 2021-04-26T16:03:15Z
dc.date.issued 1994
dc.identifier.other B16827909
dc.identifier.uri https://jupiter.ysu.edu:443/record=b1682790
dc.identifier.uri http://hdl.handle.net/1989/16217
dc.description iv, 74 leaves: figs., bibliography en_US
dc.description.abstract The main theme of this paper is to provide a basic introduction to the notion of category theory in computer science. It will include primer sections or chapters on category theory and functional programming. The category theory tutorial will discuss the basic concepts of the definition a category, and categorical limits, including the special limits (products and equalizers). Next, we have the functional programming (FP) tutorial: it contains a description of functional languages. This chapter also contains a brief history of FP. The tutorial is then further refined into description of the functional language ML and providing a basic reference of useful functions and syntax of ML. These primers and tutorials gives the necessary insight for the final illustration of a categorical proof encoded in the programming language of SML/NJ (standard meta-language of New Jersey). The illustration makes use of the constructions and definitions from the tutorial chapters, and provides a sense of cohesion to the material. en_US
dc.description.sponsorship Youngstown State University. Department of Mathematics. en_US
dc.language.iso en_US en_US
dc.relation.ispartofseries Master's Theses;no. 0500
dc.title Limitations of SML in computational category theory en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Digital.Maag


Advanced Search

Browse

My Account