CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Simple and compositional reification of monadic embedded languages

Josef Svenningsson (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; Joel Svensson (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers))
ACM SIGPLAN Notices (1523-2867). Vol. 48 (2013), 9, p. 299-304.
[Artikel, refereegranskad vetenskaplig]

When writing embedded domain specific languages in Haskell, it is often convenient to be able to make an instance of the Monad class to take advantage of the do-notation and the extensive monad libraries. Commonly it is desirable to compile such languages rather than just interpret them. This introduces the problem of monad reification, i.e. observing the structure of the monadic computation. We present a solution to the monad reification problem and illustrate it with a small robot control language. Monad reification is not new but the novelty of our approach is in its directness, simplicity and compositionality.



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2014-01-16. Senast ändrad 2016-06-27.
CPL Pubid: 192640