Programming with monoidal profunctors and semiarrows

• Ano de defesa: 2023
• Autor(a) principal: Oliveira, Alexandre Garcia de
• Tipo de documento: Tese
• Tipo de acesso: Acesso aberto
• Idioma: eng
• Instituição de defesa: Biblioteca Digitais de Teses e Dissertações da USP
• Palavras-chave em Português: Effectful monoidal profunctors; Functional programming; Máquinas de Moore; Monoidal profunctors; Moore machines; Profunctores monoidais com efeitos colaterais; Profuntores monoidais; Programação funcional; Programação síncrona; Semiarrows; Synchronous programming
• Link de acesso: https://www.teses.usp.br/teses/disponiveis/45/45134/tde-03112023-152323/

This work investigates monoidal profunctors and their extensions, such as effectful monoidal profunctors and semiarrows, as tools for reasoning and structuring pure functional programs from a categorical perspective and within a Haskell implementation. We approach them as monoids within a specific monoidal category of profunctors and as semiarrows in a semiarrow category. We examine the properties of this monoidal category and construct and implement the free monoidal profunctor. Furthermore, we detail the properties and laws of a semiarrow, deriving examples of its usage and highlighting its potential for effectively managing delays in synchronous programs. Moore machines serve as an illustrative example. Additional applications include optics and a monoidal profunctor structure-preserving connection between Moore machines, left scans, and left folds.