Artículos de revistas
Haskell Type System Analysis
Registro en:
10.22456/2175-2745.82395
Autor
Silva, Rafael Castro G.
Roggia, Karina Girardi
Vasconcellos, Cristiano Damiani
Resumen
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.