Work

Haskell Type System Analysis

Year: 2018

Type: article

Abstract: Types systems of programming languages are becoming more and more sophisticated and, in some cases, they are based on concepts from Logic, Type Theory and Category Theory. Haskell is a language with a modern type system and it is often singled out as an example using such theories. This work presents a small formalization of the Haskell type system and an analysis based on the mentioned theories, including its relation with the Intuitionist Propositional Second Order Logic and its logical characteristics, if there is a category in its type system and how monads are just monoids in the category of Haskell's endofunctors.

Source: Revista de Informática Teórica e Aplicada

DOI: 10.22456/2175-2745.82395

Authors: Rafael Castro G. Silva, Karina Girardi Roggia, Cristiano Damiani Vasconcellos

Institution: Universidade do Estado de Santa Catarina

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2892327928

FWCI:

Cites: 14

Cited by:

Related to: 10