TypeCase

Abstract

A type-indexed function is a function that is defined for each member of some family of types. Haskell's type class mechanism provides collections of open type-indexed functions, in which the indexing family can be extended by defining a new type class instance but the collection of functions is fixed. The purpose of this paper is to present TypeCase: a design pattern that allows the definition of closed type-indexed functions, in which the index family is fixed but the collection of functions is extensible. It is inspired by Cheney and Hinze's work on lightweight approaches to generic programming. We generalise their techniques as a design pattern. Furthermore, we show that type-indexed functions with typeindexed types, and consequently generic functions with generic types, can also be encoded in a lightweight manner, thereby overcoming one of the main limitations of the lightweight approaches.

A construção social do conceito infância no sistema capitalista: um levantamento bibliográfico

“…Poletto (2013) realizou uma leitura crítica sobre as instituições de acolhimento, apontando uma desarticulação nas políticas públicas que corroboram as institucionalizações, esse fato levou a pesquisadora a concluir que pouco adianta institucionalizar as crianças se as famílias destas não fizerem parte do processo, logo, o ciclo de violências se perpetuará. Nesse sentido, Oliveira (2005) destaca que os resquícios das desigualdades promovem a violência a esse público na contemporaneidade brasileira.…”

Generic Programming in OCaml

“…With TypeCase [33], a GADT is made implicit through by using type classes to implement catamorphisms over the GADT. That technique may be used to make a Haskell-98 compatible library, since GADT are not valid Haskell-98.…”